About the Execution of Smart+red for PolyORBLF-PT-S04J06T08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3458.663 | 3600000.00 | 3661719.00 | 6190.80 | FFFTFFTFTFFFF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r299-tall-167873953200574.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBLF-PT-S04J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953200574
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 20K Feb 26 14:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 14:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 74K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 338K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Feb 26 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 583K Feb 26 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.5M Mar 5 18:23 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 PolyORBLF-PT-S04J06T08-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679512993792
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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 19:23:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 19:23:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 19:23:15] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2023-03-22 19:23:15] [INFO ] Transformed 792 places.
[2023-03-22 19:23:15] [INFO ] Transformed 4268 transitions.
[2023-03-22 19:23:15] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 305 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 19:23:17] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 792 cols
[2023-03-22 19:23:17] [INFO ] Computed 58 place invariants in 144 ms
[2023-03-22 19:23:18] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-22 19:23:18] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 49 ms returned sat
[2023-03-22 19:23:18] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-22 19:23:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-22 19:23:18] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 41 ms returned sat
[2023-03-22 19:23:25] [INFO ] After 6397ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :1
[2023-03-22 19:23:25] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:23:30] [INFO ] After 5556ms SMT Verify possible using 160 Read/Feed constraints in natural domain returned unsat :11 sat :1
[2023-03-22 19:23:30] [INFO ] Deduced a trap composed of 83 places in 166 ms of which 12 ms to minimize.
[2023-03-22 19:23:31] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2023-03-22 19:23:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1436 ms
[2023-03-22 19:23:32] [INFO ] After 7055ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-22 19:23:32] [INFO ] After 13881ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T08-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 788 transition count 2029
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 147 place count 717 transition count 2028
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 716 transition count 2028
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 148 place count 716 transition count 1933
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 338 place count 621 transition count 1933
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 498 place count 541 transition count 1853
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 514 place count 541 transition count 1837
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 530 place count 525 transition count 1837
Applied a total of 530 rules in 350 ms. Remains 525 /792 variables (removed 267) and now considering 1837/2100 (removed 263) transitions.
[2023-03-22 19:23:32] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 525 cols
[2023-03-22 19:23:32] [INFO ] Computed 54 place invariants in 48 ms
[2023-03-22 19:23:33] [INFO ] Dead Transitions using invariants and state equation in 1217 ms found 432 transitions.
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 525/792 places, 1405/2100 transitions.
Applied a total of 0 rules in 36 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1607 ms. Remains : 525/792 places, 1405/2100 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 172995 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172995 steps, saw 128972 distinct states, run finished after 3002 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:23:36] [INFO ] Flow matrix only has 1373 transitions (discarded 32 similar events)
// Phase 1: matrix 1373 rows 525 cols
[2023-03-22 19:23:36] [INFO ] Computed 54 place invariants in 46 ms
[2023-03-22 19:23:37] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 19:23:37] [INFO ] [Real]Absence check using 16 positive and 38 generalized place invariants in 33 ms returned sat
[2023-03-22 19:24:02] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1405/1405 transitions.
Applied a total of 0 rules in 29 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 525/525 places, 1405/1405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 1405/1405 transitions.
Applied a total of 0 rules in 26 ms. Remains 525 /525 variables (removed 0) and now considering 1405/1405 (removed 0) transitions.
[2023-03-22 19:24:02] [INFO ] Flow matrix only has 1373 transitions (discarded 32 similar events)
[2023-03-22 19:24:02] [INFO ] Invariant cache hit.
[2023-03-22 19:24:02] [INFO ] Implicit Places using invariants in 658 ms returned [2, 89, 99, 145, 196, 232, 257, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 661 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 517/525 places, 1405/1405 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 511 transition count 1399
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 511 transition count 1399
Applied a total of 12 rules in 55 ms. Remains 511 /517 variables (removed 6) and now considering 1399/1405 (removed 6) transitions.
[2023-03-22 19:24:02] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
// Phase 1: matrix 1367 rows 511 cols
[2023-03-22 19:24:02] [INFO ] Computed 46 place invariants in 29 ms
[2023-03-22 19:24:03] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-22 19:24:03] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-22 19:24:03] [INFO ] Invariant cache hit.
[2023-03-22 19:24:04] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:24:32] [INFO ] Implicit Places using invariants and state equation in 29200 ms returned []
Implicit Place search using SMT with State Equation took 29861 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 511/525 places, 1399/1405 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30605 ms. Remains : 511/525 places, 1399/1405 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181982 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181982 steps, saw 127813 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 19:24:35] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-22 19:24:35] [INFO ] Invariant cache hit.
[2023-03-22 19:24:35] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 19:24:35] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 29 ms returned sat
[2023-03-22 19:24:35] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:24:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 19:24:35] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 31 ms returned sat
[2023-03-22 19:25:00] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1399/1399 transitions.
Applied a total of 0 rules in 33 ms. Remains 511 /511 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 511/511 places, 1399/1399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 1399/1399 transitions.
Applied a total of 0 rules in 25 ms. Remains 511 /511 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
[2023-03-22 19:25:00] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-22 19:25:00] [INFO ] Invariant cache hit.
[2023-03-22 19:25:01] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-22 19:25:01] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-22 19:25:01] [INFO ] Invariant cache hit.
[2023-03-22 19:25:02] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-22 19:25:30] [INFO ] Implicit Places using invariants and state equation in 28885 ms returned []
Implicit Place search using SMT with State Equation took 29494 ms to find 0 implicit places.
[2023-03-22 19:25:30] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-22 19:25:30] [INFO ] Flow matrix only has 1367 transitions (discarded 32 similar events)
[2023-03-22 19:25:30] [INFO ] Invariant cache hit.
[2023-03-22 19:25:31] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30586 ms. Remains : 511/511 places, 1399/1399 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 511 transition count 1367
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 48 place count 503 transition count 1447
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 1 with 64 rules applied. Total rules applied 112 place count 503 transition count 1383
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 503 transition count 1375
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 128 place count 495 transition count 1375
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 495 transition count 1363
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 152 place count 483 transition count 1363
Applied a total of 152 rules in 112 ms. Remains 483 /511 variables (removed 28) and now considering 1363/1399 (removed 36) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1363 rows 483 cols
[2023-03-22 19:25:31] [INFO ] Computed 46 place invariants in 20 ms
[2023-03-22 19:25:31] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 19:25:31] [INFO ] [Real]Absence check using 16 positive and 30 generalized place invariants in 29 ms returned sat
[2023-03-22 19:25:38] [INFO ] After 6931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 19:25:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-22 19:25:38] [INFO ] [Nat]Absence check using 16 positive and 30 generalized place invariants in 30 ms returned sat
[2023-03-22 19:25:43] [INFO ] After 4806ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 19:25:43] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2023-03-22 19:25:44] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2023-03-22 19:25:45] [INFO ] Deduced a trap composed of 98 places in 248 ms of which 1 ms to minimize.
[2023-03-22 19:25:45] [INFO ] Deduced a trap composed of 85 places in 222 ms of which 1 ms to minimize.
[2023-03-22 19:25:46] [INFO ] Deduced a trap composed of 83 places in 220 ms of which 1 ms to minimize.
[2023-03-22 19:25:46] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 1 ms to minimize.
[2023-03-22 19:25:46] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 0 ms to minimize.
[2023-03-22 19:25:47] [INFO ] Deduced a trap composed of 85 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:25:49] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2023-03-22 19:25:49] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2023-03-22 19:25:50] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2023-03-22 19:25:50] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 0 ms to minimize.
[2023-03-22 19:25:51] [INFO ] Deduced a trap composed of 186 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:25:51] [INFO ] Deduced a trap composed of 129 places in 227 ms of which 0 ms to minimize.
[2023-03-22 19:25:51] [INFO ] Deduced a trap composed of 213 places in 228 ms of which 1 ms to minimize.
[2023-03-22 19:25:52] [INFO ] Deduced a trap composed of 154 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:25:52] [INFO ] Deduced a trap composed of 132 places in 231 ms of which 0 ms to minimize.
[2023-03-22 19:25:53] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:25:53] [INFO ] Deduced a trap composed of 144 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:25:53] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:25:54] [INFO ] Deduced a trap composed of 147 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:25:54] [INFO ] Deduced a trap composed of 179 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:25:54] [INFO ] Deduced a trap composed of 195 places in 214 ms of which 0 ms to minimize.
[2023-03-22 19:25:54] [INFO ] Deduced a trap composed of 142 places in 220 ms of which 1 ms to minimize.
[2023-03-22 19:25:55] [INFO ] Deduced a trap composed of 153 places in 213 ms of which 1 ms to minimize.
[2023-03-22 19:25:55] [INFO ] Deduced a trap composed of 157 places in 210 ms of which 0 ms to minimize.
[2023-03-22 19:25:55] [INFO ] Deduced a trap composed of 203 places in 220 ms of which 0 ms to minimize.
[2023-03-22 19:25:55] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 0 ms to minimize.
[2023-03-22 19:25:56] [INFO ] Deduced a trap composed of 146 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:25:56] [INFO ] Deduced a trap composed of 181 places in 220 ms of which 0 ms to minimize.
[2023-03-22 19:25:56] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:25:57] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 2 ms to minimize.
[2023-03-22 19:25:57] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 0 ms to minimize.
[2023-03-22 19:25:57] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 0 ms to minimize.
[2023-03-22 19:25:58] [INFO ] Deduced a trap composed of 83 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:25:58] [INFO ] Deduced a trap composed of 155 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:25:58] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 1 ms to minimize.
[2023-03-22 19:25:59] [INFO ] Deduced a trap composed of 221 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:25:59] [INFO ] Deduced a trap composed of 69 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:25:59] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:26:00] [INFO ] Deduced a trap composed of 153 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:26:00] [INFO ] Deduced a trap composed of 69 places in 233 ms of which 0 ms to minimize.
[2023-03-22 19:26:00] [INFO ] Deduced a trap composed of 108 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:26:01] [INFO ] Deduced a trap composed of 69 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:26:01] [INFO ] Deduced a trap composed of 114 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:26:01] [INFO ] Deduced a trap composed of 111 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:26:02] [INFO ] Deduced a trap composed of 110 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:26:02] [INFO ] Deduced a trap composed of 193 places in 237 ms of which 1 ms to minimize.
[2023-03-22 19:26:02] [INFO ] Deduced a trap composed of 130 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:26:03] [INFO ] Deduced a trap composed of 143 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:26:03] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2023-03-22 19:26:03] [INFO ] Deduced a trap composed of 137 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:26:03] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:26:04] [INFO ] Deduced a trap composed of 178 places in 234 ms of which 1 ms to minimize.
[2023-03-22 19:26:04] [INFO ] Deduced a trap composed of 151 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:26:04] [INFO ] Deduced a trap composed of 156 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:26:05] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:26:05] [INFO ] Deduced a trap composed of 125 places in 231 ms of which 0 ms to minimize.
[2023-03-22 19:26:05] [INFO ] Deduced a trap composed of 184 places in 227 ms of which 0 ms to minimize.
[2023-03-22 19:26:06] [INFO ] Deduced a trap composed of 201 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:26:06] [INFO ] Deduced a trap composed of 221 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:26:06] [INFO ] Deduced a trap composed of 215 places in 234 ms of which 2 ms to minimize.
[2023-03-22 19:26:07] [INFO ] Deduced a trap composed of 185 places in 231 ms of which 0 ms to minimize.
[2023-03-22 19:26:07] [INFO ] Deduced a trap composed of 206 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:26:07] [INFO ] Deduced a trap composed of 223 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:26:08] [INFO ] Deduced a trap composed of 205 places in 221 ms of which 2 ms to minimize.
[2023-03-22 19:26:08] [INFO ] Deduced a trap composed of 205 places in 219 ms of which 2 ms to minimize.
[2023-03-22 19:26:08] [INFO ] Deduced a trap composed of 184 places in 225 ms of which 1 ms to minimize.
[2023-03-22 19:26:08] [INFO ] Deduced a trap composed of 167 places in 219 ms of which 0 ms to minimize.
[2023-03-22 19:26:09] [INFO ] Deduced a trap composed of 140 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:26:09] [INFO ] Deduced a trap composed of 186 places in 224 ms of which 1 ms to minimize.
[2023-03-22 19:26:09] [INFO ] Deduced a trap composed of 149 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:26:10] [INFO ] Deduced a trap composed of 147 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:26:10] [INFO ] Deduced a trap composed of 157 places in 219 ms of which 0 ms to minimize.
[2023-03-22 19:26:10] [INFO ] Deduced a trap composed of 193 places in 224 ms of which 1 ms to minimize.
[2023-03-22 19:26:10] [INFO ] Deduced a trap composed of 204 places in 213 ms of which 0 ms to minimize.
[2023-03-22 19:26:11] [INFO ] Deduced a trap composed of 165 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:26:11] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2023-03-22 19:26:11] [INFO ] Deduced a trap composed of 157 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:26:12] [INFO ] Deduced a trap composed of 244 places in 231 ms of which 5 ms to minimize.
[2023-03-22 19:26:12] [INFO ] Deduced a trap composed of 161 places in 215 ms of which 0 ms to minimize.
[2023-03-22 19:26:12] [INFO ] Deduced a trap composed of 147 places in 230 ms of which 1 ms to minimize.
[2023-03-22 19:26:13] [INFO ] Deduced a trap composed of 139 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:26:13] [INFO ] Deduced a trap composed of 192 places in 213 ms of which 0 ms to minimize.
[2023-03-22 19:26:13] [INFO ] Deduced a trap composed of 148 places in 233 ms of which 0 ms to minimize.
[2023-03-22 19:26:14] [INFO ] Deduced a trap composed of 177 places in 226 ms of which 1 ms to minimize.
[2023-03-22 19:26:14] [INFO ] Deduced a trap composed of 232 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:26:14] [INFO ] Deduced a trap composed of 223 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:26:15] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 1 ms to minimize.
[2023-03-22 19:26:15] [INFO ] Deduced a trap composed of 161 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:26:15] [INFO ] Deduced a trap composed of 143 places in 217 ms of which 1 ms to minimize.
[2023-03-22 19:26:16] [INFO ] Deduced a trap composed of 212 places in 228 ms of which 1 ms to minimize.
[2023-03-22 19:26:16] [INFO ] Deduced a trap composed of 224 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:26:16] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:26:17] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:26:17] [INFO ] Deduced a trap composed of 152 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:26:18] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:26:18] [INFO ] Deduced a trap composed of 149 places in 218 ms of which 0 ms to minimize.
[2023-03-22 19:26:19] [INFO ] Deduced a trap composed of 150 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:26:19] [INFO ] Deduced a trap composed of 174 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:26:19] [INFO ] Deduced a trap composed of 205 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:26:20] [INFO ] Deduced a trap composed of 218 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:26:20] [INFO ] Deduced a trap composed of 160 places in 245 ms of which 1 ms to minimize.
[2023-03-22 19:26:21] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 0 ms to minimize.
[2023-03-22 19:26:21] [INFO ] Deduced a trap composed of 97 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:26:21] [INFO ] Deduced a trap composed of 159 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:26:22] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:26:22] [INFO ] Deduced a trap composed of 152 places in 254 ms of which 1 ms to minimize.
[2023-03-22 19:26:22] [INFO ] Deduced a trap composed of 173 places in 257 ms of which 1 ms to minimize.
[2023-03-22 19:26:23] [INFO ] Deduced a trap composed of 148 places in 251 ms of which 1 ms to minimize.
[2023-03-22 19:26:23] [INFO ] Deduced a trap composed of 149 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:26:23] [INFO ] Deduced a trap composed of 204 places in 258 ms of which 0 ms to minimize.
[2023-03-22 19:26:24] [INFO ] Deduced a trap composed of 187 places in 258 ms of which 0 ms to minimize.
[2023-03-22 19:26:24] [INFO ] Deduced a trap composed of 134 places in 265 ms of which 0 ms to minimize.
[2023-03-22 19:26:24] [INFO ] Deduced a trap composed of 83 places in 234 ms of which 1 ms to minimize.
[2023-03-22 19:26:25] [INFO ] Deduced a trap composed of 207 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:26:25] [INFO ] Deduced a trap composed of 164 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:26:25] [INFO ] Deduced a trap composed of 188 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:26:26] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:26:27] [INFO ] Deduced a trap composed of 153 places in 235 ms of which 0 ms to minimize.
[2023-03-22 19:26:27] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:26:27] [INFO ] Deduced a trap composed of 194 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:26:28] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:26:28] [INFO ] Deduced a trap composed of 169 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:26:29] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:26:29] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2023-03-22 19:26:29] [INFO ] Deduced a trap composed of 143 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:26:30] [INFO ] Deduced a trap composed of 207 places in 243 ms of which 1 ms to minimize.
[2023-03-22 19:26:30] [INFO ] Deduced a trap composed of 159 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:26:31] [INFO ] Deduced a trap composed of 174 places in 225 ms of which 1 ms to minimize.
[2023-03-22 19:26:31] [INFO ] Deduced a trap composed of 146 places in 245 ms of which 0 ms to minimize.
[2023-03-22 19:26:32] [INFO ] Deduced a trap composed of 171 places in 259 ms of which 1 ms to minimize.
[2023-03-22 19:26:32] [INFO ] Deduced a trap composed of 157 places in 257 ms of which 0 ms to minimize.
[2023-03-22 19:26:32] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:26:33] [INFO ] Deduced a trap composed of 159 places in 261 ms of which 0 ms to minimize.
[2023-03-22 19:26:33] [INFO ] Deduced a trap composed of 224 places in 257 ms of which 0 ms to minimize.
[2023-03-22 19:26:34] [INFO ] Deduced a trap composed of 85 places in 261 ms of which 1 ms to minimize.
[2023-03-22 19:26:34] [INFO ] Deduced a trap composed of 165 places in 261 ms of which 0 ms to minimize.
[2023-03-22 19:26:34] [INFO ] Deduced a trap composed of 177 places in 255 ms of which 0 ms to minimize.
[2023-03-22 19:26:35] [INFO ] Deduced a trap composed of 139 places in 225 ms of which 2 ms to minimize.
[2023-03-22 19:26:36] [INFO ] Deduced a trap composed of 166 places in 250 ms of which 1 ms to minimize.
[2023-03-22 19:26:36] [INFO ] Deduced a trap composed of 157 places in 251 ms of which 0 ms to minimize.
[2023-03-22 19:26:36] [INFO ] Deduced a trap composed of 211 places in 279 ms of which 0 ms to minimize.
[2023-03-22 19:26:37] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:26:37] [INFO ] Deduced a trap composed of 167 places in 221 ms of which 0 ms to minimize.
[2023-03-22 19:26:37] [INFO ] Deduced a trap composed of 201 places in 216 ms of which 1 ms to minimize.
[2023-03-22 19:26:38] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-22 19:26:38] [INFO ] Deduced a trap composed of 69 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:26:38] [INFO ] Deduced a trap composed of 145 places in 220 ms of which 1 ms to minimize.
[2023-03-22 19:26:38] [INFO ] Deduced a trap composed of 149 places in 211 ms of which 0 ms to minimize.
[2023-03-22 19:26:39] [INFO ] Deduced a trap composed of 159 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:26:39] [INFO ] Deduced a trap composed of 164 places in 248 ms of which 0 ms to minimize.
[2023-03-22 19:26:40] [INFO ] Deduced a trap composed of 179 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:26:40] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:26:41] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:26:41] [INFO ] Deduced a trap composed of 69 places in 243 ms of which 1 ms to minimize.
[2023-03-22 19:26:42] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 1 ms to minimize.
[2023-03-22 19:26:42] [INFO ] Deduced a trap composed of 113 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:26:42] [INFO ] Deduced a trap composed of 88 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:26:42] [INFO ] Deduced a trap composed of 142 places in 222 ms of which 1 ms to minimize.
[2023-03-22 19:26:43] [INFO ] Deduced a trap composed of 154 places in 222 ms of which 1 ms to minimize.
[2023-03-22 19:26:43] [INFO ] Deduced a trap composed of 189 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:26:43] [INFO ] Deduced a trap composed of 204 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:26:44] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 0 ms to minimize.
[2023-03-22 19:26:44] [INFO ] Deduced a trap composed of 113 places in 243 ms of which 0 ms to minimize.
[2023-03-22 19:26:46] [INFO ] Deduced a trap composed of 199 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:26:46] [INFO ] Deduced a trap composed of 89 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:26:48] [INFO ] Deduced a trap composed of 219 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:26:48] [INFO ] Deduced a trap composed of 98 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:26:49] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 0 ms to minimize.
[2023-03-22 19:26:49] [INFO ] Deduced a trap composed of 142 places in 248 ms of which 0 ms to minimize.
[2023-03-22 19:26:50] [INFO ] Deduced a trap composed of 155 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:26:50] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-22 19:26:51] [INFO ] Deduced a trap composed of 104 places in 257 ms of which 0 ms to minimize.
[2023-03-22 19:26:51] [INFO ] Deduced a trap composed of 144 places in 252 ms of which 1 ms to minimize.
[2023-03-22 19:26:52] [INFO ] Deduced a trap composed of 140 places in 248 ms of which 1 ms to minimize.
[2023-03-22 19:26:52] [INFO ] Deduced a trap composed of 266 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:26:52] [INFO ] Deduced a trap composed of 151 places in 263 ms of which 1 ms to minimize.
[2023-03-22 19:26:53] [INFO ] Deduced a trap composed of 69 places in 237 ms of which 0 ms to minimize.
[2023-03-22 19:26:53] [INFO ] Deduced a trap composed of 82 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:26:53] [INFO ] Deduced a trap composed of 184 places in 258 ms of which 0 ms to minimize.
[2023-03-22 19:26:54] [INFO ] Deduced a trap composed of 152 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:26:54] [INFO ] Deduced a trap composed of 174 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:26:54] [INFO ] Deduced a trap composed of 163 places in 238 ms of which 0 ms to minimize.
[2023-03-22 19:26:55] [INFO ] Deduced a trap composed of 212 places in 243 ms of which 1 ms to minimize.
[2023-03-22 19:26:56] [INFO ] Deduced a trap composed of 69 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:26:56] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 0 ms to minimize.
[2023-03-22 19:26:57] [INFO ] Deduced a trap composed of 85 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:26:58] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 1 ms to minimize.
[2023-03-22 19:26:58] [INFO ] Deduced a trap composed of 69 places in 249 ms of which 1 ms to minimize.
[2023-03-22 19:26:59] [INFO ] Deduced a trap composed of 69 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:27:00] [INFO ] Deduced a trap composed of 200 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:27:00] [INFO ] Deduced a trap composed of 150 places in 248 ms of which 0 ms to minimize.
[2023-03-22 19:27:00] [INFO ] Deduced a trap composed of 187 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:27:01] [INFO ] Deduced a trap composed of 210 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:27:01] [INFO ] Deduced a trap composed of 214 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:27:02] [INFO ] Deduced a trap composed of 220 places in 261 ms of which 0 ms to minimize.
[2023-03-22 19:27:02] [INFO ] Deduced a trap composed of 184 places in 254 ms of which 1 ms to minimize.
[2023-03-22 19:27:03] [INFO ] Deduced a trap composed of 189 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:27:03] [INFO ] Deduced a trap composed of 195 places in 253 ms of which 0 ms to minimize.
[2023-03-22 19:27:04] [INFO ] Deduced a trap composed of 197 places in 237 ms of which 1 ms to minimize.
[2023-03-22 19:27:04] [INFO ] Deduced a trap composed of 166 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:27:04] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 0 ms to minimize.
[2023-03-22 19:27:05] [INFO ] Deduced a trap composed of 150 places in 243 ms of which 1 ms to minimize.
[2023-03-22 19:27:05] [INFO ] Deduced a trap composed of 141 places in 216 ms of which 1 ms to minimize.
[2023-03-22 19:27:05] [INFO ] Deduced a trap composed of 207 places in 215 ms of which 0 ms to minimize.
[2023-03-22 19:27:06] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 0 ms to minimize.
[2023-03-22 19:27:06] [INFO ] Deduced a trap composed of 154 places in 224 ms of which 1 ms to minimize.
[2023-03-22 19:27:06] [INFO ] Deduced a trap composed of 195 places in 227 ms of which 0 ms to minimize.
[2023-03-22 19:27:07] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-22 19:27:07] [INFO ] Deduced a trap composed of 153 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:27:07] [INFO ] Deduced a trap composed of 140 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:27:07] [INFO ] Deduced a trap composed of 177 places in 217 ms of which 0 ms to minimize.
[2023-03-22 19:27:08] [INFO ] Deduced a trap composed of 186 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:27:09] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 0 ms to minimize.
[2023-03-22 19:27:09] [INFO ] Deduced a trap composed of 202 places in 226 ms of which 1 ms to minimize.
[2023-03-22 19:27:09] [INFO ] Deduced a trap composed of 152 places in 219 ms of which 1 ms to minimize.
[2023-03-22 19:27:09] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:27:10] [INFO ] Deduced a trap composed of 156 places in 235 ms of which 0 ms to minimize.
[2023-03-22 19:27:10] [INFO ] Deduced a trap composed of 69 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:27:10] [INFO ] Deduced a trap composed of 213 places in 226 ms of which 1 ms to minimize.
[2023-03-22 19:27:11] [INFO ] Deduced a trap composed of 153 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:27:11] [INFO ] Deduced a trap composed of 142 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:27:11] [INFO ] Deduced a trap composed of 208 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:27:12] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 0 ms to minimize.
[2023-03-22 19:27:12] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:27:12] [INFO ] Deduced a trap composed of 145 places in 218 ms of which 0 ms to minimize.
[2023-03-22 19:27:13] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 0 ms to minimize.
[2023-03-22 19:27:13] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2023-03-22 19:27:14] [INFO ] Deduced a trap composed of 109 places in 237 ms of which 0 ms to minimize.
[2023-03-22 19:27:15] [INFO ] Deduced a trap composed of 69 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:27:16] [INFO ] Deduced a trap composed of 93 places in 238 ms of which 0 ms to minimize.
[2023-03-22 19:27:16] [INFO ] Deduced a trap composed of 184 places in 230 ms of which 0 ms to minimize.
[2023-03-22 19:27:17] [INFO ] Deduced a trap composed of 174 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:27:17] [INFO ] Deduced a trap composed of 155 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:27:17] [INFO ] Deduced a trap composed of 139 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:27:18] [INFO ] Deduced a trap composed of 148 places in 237 ms of which 1 ms to minimize.
[2023-03-22 19:27:18] [INFO ] Deduced a trap composed of 153 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:27:19] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:27:19] [INFO ] Deduced a trap composed of 153 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:27:19] [INFO ] Deduced a trap composed of 140 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:27:20] [INFO ] Deduced a trap composed of 169 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:27:20] [INFO ] Deduced a trap composed of 217 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:27:20] [INFO ] Deduced a trap composed of 208 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:27:21] [INFO ] Deduced a trap composed of 159 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:27:21] [INFO ] Deduced a trap composed of 209 places in 241 ms of which 2 ms to minimize.
[2023-03-22 19:27:21] [INFO ] Deduced a trap composed of 213 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:27:22] [INFO ] Deduced a trap composed of 153 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:27:22] [INFO ] Deduced a trap composed of 153 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:27:22] [INFO ] Deduced a trap composed of 149 places in 219 ms of which 0 ms to minimize.
[2023-03-22 19:27:23] [INFO ] Deduced a trap composed of 228 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:27:23] [INFO ] Deduced a trap composed of 177 places in 210 ms of which 1 ms to minimize.
[2023-03-22 19:27:23] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 2 ms to minimize.
[2023-03-22 19:27:24] [INFO ] Deduced a trap composed of 187 places in 220 ms of which 1 ms to minimize.
[2023-03-22 19:27:24] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 1 ms to minimize.
[2023-03-22 19:27:25] [INFO ] Deduced a trap composed of 115 places in 237 ms of which 1 ms to minimize.
[2023-03-22 19:27:27] [INFO ] Deduced a trap composed of 157 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:27:28] [INFO ] Deduced a trap composed of 88 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:27:28] [INFO ] Deduced a trap composed of 214 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:27:29] [INFO ] Deduced a trap composed of 227 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:27:29] [INFO ] Deduced a trap composed of 132 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:27:30] [INFO ] Deduced a trap composed of 129 places in 239 ms of which 1 ms to minimize.
[2023-03-22 19:27:30] [INFO ] Deduced a trap composed of 203 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:27:31] [INFO ] Deduced a trap composed of 258 places in 235 ms of which 1 ms to minimize.
[2023-03-22 19:27:32] [INFO ] Deduced a trap composed of 127 places in 245 ms of which 0 ms to minimize.
[2023-03-22 19:27:32] [INFO ] Deduced a trap composed of 91 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:27:33] [INFO ] Deduced a trap composed of 271 places in 255 ms of which 0 ms to minimize.
[2023-03-22 19:27:33] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:27:34] [INFO ] Deduced a trap composed of 202 places in 229 ms of which 0 ms to minimize.
[2023-03-22 19:27:34] [INFO ] Deduced a trap composed of 146 places in 249 ms of which 0 ms to minimize.
[2023-03-22 19:27:35] [INFO ] Deduced a trap composed of 140 places in 245 ms of which 1 ms to minimize.
[2023-03-22 19:27:35] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-22 19:27:36] [INFO ] Deduced a trap composed of 156 places in 240 ms of which 1 ms to minimize.
[2023-03-22 19:27:36] [INFO ] Deduced a trap composed of 150 places in 252 ms of which 1 ms to minimize.
[2023-03-22 19:27:36] [INFO ] Deduced a trap composed of 149 places in 249 ms of which 0 ms to minimize.
[2023-03-22 19:27:37] [INFO ] Deduced a trap composed of 260 places in 228 ms of which 1 ms to minimize.
[2023-03-22 19:27:37] [INFO ] Deduced a trap composed of 152 places in 256 ms of which 0 ms to minimize.
[2023-03-22 19:27:38] [INFO ] Deduced a trap composed of 85 places in 255 ms of which 0 ms to minimize.
[2023-03-22 19:27:38] [INFO ] Deduced a trap composed of 162 places in 246 ms of which 0 ms to minimize.
[2023-03-22 19:27:38] [INFO ] Deduced a trap composed of 146 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:27:39] [INFO ] Deduced a trap composed of 204 places in 223 ms of which 1 ms to minimize.
[2023-03-22 19:27:39] [INFO ] Deduced a trap composed of 180 places in 253 ms of which 1 ms to minimize.
[2023-03-22 19:27:39] [INFO ] Deduced a trap composed of 148 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:27:40] [INFO ] Deduced a trap composed of 164 places in 243 ms of which 0 ms to minimize.
[2023-03-22 19:27:40] [INFO ] Deduced a trap composed of 264 places in 248 ms of which 0 ms to minimize.
[2023-03-22 19:27:41] [INFO ] Deduced a trap composed of 143 places in 253 ms of which 0 ms to minimize.
[2023-03-22 19:27:41] [INFO ] Deduced a trap composed of 153 places in 243 ms of which 1 ms to minimize.
[2023-03-22 19:27:41] [INFO ] Deduced a trap composed of 109 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:27:42] [INFO ] Deduced a trap composed of 115 places in 256 ms of which 1 ms to minimize.
[2023-03-22 19:27:42] [INFO ] Deduced a trap composed of 143 places in 251 ms of which 0 ms to minimize.
[2023-03-22 19:27:43] [INFO ] Deduced a trap composed of 150 places in 252 ms of which 0 ms to minimize.
[2023-03-22 19:27:43] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 1 ms to minimize.
[2023-03-22 19:27:44] [INFO ] Deduced a trap composed of 183 places in 255 ms of which 1 ms to minimize.
[2023-03-22 19:27:44] [INFO ] Deduced a trap composed of 208 places in 246 ms of which 0 ms to minimize.
[2023-03-22 19:27:45] [INFO ] Deduced a trap composed of 153 places in 254 ms of which 0 ms to minimize.
[2023-03-22 19:27:46] [INFO ] Deduced a trap composed of 161 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:27:46] [INFO ] Deduced a trap composed of 201 places in 246 ms of which 0 ms to minimize.
[2023-03-22 19:27:46] [INFO ] Deduced a trap composed of 142 places in 240 ms of which 0 ms to minimize.
[2023-03-22 19:27:47] [INFO ] Deduced a trap composed of 165 places in 222 ms of which 1 ms to minimize.
[2023-03-22 19:27:48] [INFO ] Deduced a trap composed of 213 places in 219 ms of which 0 ms to minimize.
[2023-03-22 19:27:48] [INFO ] Deduced a trap composed of 93 places in 240 ms of which 1 ms to minimize.
[2023-03-22 19:27:49] [INFO ] Deduced a trap composed of 119 places in 234 ms of which 1 ms to minimize.
[2023-03-22 19:27:50] [INFO ] Deduced a trap composed of 136 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:27:51] [INFO ] Deduced a trap composed of 108 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:27:52] [INFO ] Deduced a trap composed of 137 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:27:53] [INFO ] Deduced a trap composed of 108 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:27:53] [INFO ] Deduced a trap composed of 179 places in 259 ms of which 1 ms to minimize.
[2023-03-22 19:27:53] [INFO ] Deduced a trap composed of 113 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:27:54] [INFO ] Deduced a trap composed of 140 places in 266 ms of which 1 ms to minimize.
[2023-03-22 19:27:54] [INFO ] Deduced a trap composed of 119 places in 252 ms of which 0 ms to minimize.
[2023-03-22 19:27:55] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 1 ms to minimize.
[2023-03-22 19:27:59] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:28:00] [INFO ] Deduced a trap composed of 165 places in 229 ms of which 1 ms to minimize.
[2023-03-22 19:28:00] [INFO ] Deduced a trap composed of 148 places in 235 ms of which 0 ms to minimize.
[2023-03-22 19:28:01] [INFO ] Deduced a trap composed of 155 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:28:01] [INFO ] Deduced a trap composed of 127 places in 225 ms of which 1 ms to minimize.
[2023-03-22 19:28:02] [INFO ] Deduced a trap composed of 119 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:28:04] [INFO ] Deduced a trap composed of 108 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:28:05] [INFO ] Deduced a trap composed of 110 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:28:06] [INFO ] Deduced a trap composed of 108 places in 225 ms of which 0 ms to minimize.
[2023-03-22 19:28:06] [INFO ] Deduced a trap composed of 212 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:28:06] [INFO ] Deduced a trap composed of 208 places in 241 ms of which 1 ms to minimize.
[2023-03-22 19:28:06] [INFO ] Deduced a trap composed of 113 places in 228 ms of which 1 ms to minimize.
[2023-03-22 19:28:07] [INFO ] Deduced a trap composed of 123 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:28:07] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:28:08] [INFO ] Deduced a trap composed of 117 places in 226 ms of which 1 ms to minimize.
[2023-03-22 19:28:08] [INFO ] Deduced a trap composed of 215 places in 243 ms of which 0 ms to minimize.
[2023-03-22 19:28:09] [INFO ] Deduced a trap composed of 118 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:28:10] [INFO ] Deduced a trap composed of 108 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:28:10] [INFO ] Deduced a trap composed of 129 places in 230 ms of which 1 ms to minimize.
[2023-03-22 19:28:10] [INFO ] Deduced a trap composed of 127 places in 234 ms of which 1 ms to minimize.
[2023-03-22 19:28:12] [INFO ] Deduced a trap composed of 216 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:28:12] [INFO ] Deduced a trap composed of 110 places in 239 ms of which 1 ms to minimize.
[2023-03-22 19:28:13] [INFO ] Deduced a trap composed of 146 places in 221 ms of which 0 ms to minimize.
[2023-03-22 19:28:13] [INFO ] Deduced a trap composed of 154 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:28:14] [INFO ] Deduced a trap composed of 135 places in 225 ms of which 1 ms to minimize.
[2023-03-22 19:28:14] [INFO ] Deduced a trap composed of 110 places in 242 ms of which 0 ms to minimize.
[2023-03-22 19:28:15] [INFO ] Deduced a trap composed of 119 places in 230 ms of which 0 ms to minimize.
[2023-03-22 19:28:16] [INFO ] Deduced a trap composed of 108 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:28:17] [INFO ] Deduced a trap composed of 108 places in 236 ms of which 1 ms to minimize.
[2023-03-22 19:28:19] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:28:19] [INFO ] Deduced a trap composed of 193 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:28:20] [INFO ] Deduced a trap composed of 217 places in 238 ms of which 1 ms to minimize.
[2023-03-22 19:28:20] [INFO ] Deduced a trap composed of 210 places in 239 ms of which 0 ms to minimize.
[2023-03-22 19:28:21] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 0 ms to minimize.
[2023-03-22 19:28:21] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 0 ms to minimize.
[2023-03-22 19:28:22] [INFO ] Deduced a trap composed of 122 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:28:22] [INFO ] Deduced a trap composed of 122 places in 241 ms of which 0 ms to minimize.
[2023-03-22 19:28:23] [INFO ] Deduced a trap composed of 129 places in 235 ms of which 0 ms to minimize.
[2023-03-22 19:28:23] [INFO ] Deduced a trap composed of 247 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:28:23] [INFO ] Deduced a trap composed of 121 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:28:24] [INFO ] Deduced a trap composed of 146 places in 240 ms of which 1 ms to minimize.
[2023-03-22 19:28:24] [INFO ] Deduced a trap composed of 245 places in 243 ms of which 0 ms to minimize.
[2023-03-22 19:28:24] [INFO ] Deduced a trap composed of 123 places in 237 ms of which 0 ms to minimize.
[2023-03-22 19:28:25] [INFO ] Deduced a trap composed of 141 places in 233 ms of which 1 ms to minimize.
[2023-03-22 19:28:25] [INFO ] Deduced a trap composed of 117 places in 236 ms of which 0 ms to minimize.
[2023-03-22 19:28:26] [INFO ] Deduced a trap composed of 111 places in 227 ms of which 1 ms to minimize.
[2023-03-22 19:28:26] [INFO ] Deduced a trap composed of 130 places in 234 ms of which 1 ms to minimize.
[2023-03-22 19:28:31] [INFO ] Deduced a trap composed of 69 places in 220 ms of which 0 ms to minimize.
[2023-03-22 19:28:32] [INFO ] Deduced a trap composed of 151 places in 227 ms of which 0 ms to minimize.
[2023-03-22 19:28:32] [INFO ] Deduced a trap composed of 152 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:28:33] [INFO ] Deduced a trap composed of 182 places in 230 ms of which 0 ms to minimize.
[2023-03-22 19:28:33] [INFO ] Deduced a trap composed of 148 places in 226 ms of which 0 ms to minimize.
[2023-03-22 19:28:34] [INFO ] Deduced a trap composed of 213 places in 216 ms of which 0 ms to minimize.
[2023-03-22 19:28:34] [INFO ] Deduced a trap composed of 203 places in 214 ms of which 1 ms to minimize.
[2023-03-22 19:28:35] [INFO ] Deduced a trap composed of 172 places in 205 ms of which 0 ms to minimize.
[2023-03-22 19:28:35] [INFO ] Deduced a trap composed of 131 places in 231 ms of which 1 ms to minimize.
[2023-03-22 19:28:35] [INFO ] Deduced a trap composed of 163 places in 232 ms of which 0 ms to minimize.
[2023-03-22 19:28:36] [INFO ] Deduced a trap composed of 222 places in 228 ms of which 0 ms to minimize.
[2023-03-22 19:28:36] [INFO ] Deduced a trap composed of 253 places in 234 ms of which 0 ms to minimize.
[2023-03-22 19:28:36] [INFO ] Deduced a trap composed of 161 places in 218 ms of which 0 ms to minimize.
[2023-03-22 19:28:38] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 1 ms to minimize.
[2023-03-22 19:28:39] [INFO ] Deduced a trap composed of 139 places in 232 ms of which 1 ms to minimize.
[2023-03-22 19:28:39] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 1 ms to minimize.
[2023-03-22 19:28:39] [INFO ] Deduced a trap composed of 173 places in 215 ms of which 1 ms to minimize.
[2023-03-22 19:28:40] [INFO ] Deduced a trap composed of 143 places in 218 ms of which 1 ms to minimize.
[2023-03-22 19:28:40] [INFO ] Deduced a trap composed of 139 places in 214 ms of which 1 ms to minimize.
[2023-03-22 19:28:40] [INFO ] Trap strengthening (SAT) tested/added 378/377 trap constraints in 177401 ms
[2023-03-22 19:28:41] [INFO ] After 182619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-22 19:28:41] [INFO ] After 182985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 19:28:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 19:28:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 511 places, 1399 transitions and 7260 arcs took 12 ms.
[2023-03-22 19:28:41] [INFO ] Flatten gal took : 158 ms
Total runtime 326751 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBLF (PT), instance S04J06T08
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 511 places, 1399 transitions, 7260 arcs.
Final Score: 136480.105
Took : 24 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: PolyORBLF-PT-S04J06T08-ReachabilityCardinality-13 (reachable &!potential( (! ( ( 4 ) <= (tk(P53)) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 12685868 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16098720 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="PolyORBLF-PT-S04J06T08"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBLF-PT-S04J06T08, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r299-tall-167873953200574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T08.tgz
mv PolyORBLF-PT-S04J06T08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;