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.r297-tall-167873950900754.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 ltsminxred
Input is PolyORBNT-PT-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 17K Feb 26 01:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 01:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1002K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Feb 26 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 196K Feb 26 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 708K Feb 26 02:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 26 02:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13M 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 PolyORBNT-PT-S10J20-CTLFireability-00
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-01
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-02
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-03
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-04
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-05
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-06
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-07
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-08
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-09
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-10
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-11
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-12
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-13
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-14
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679636830512

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 05:47:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 05:47:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 05:47:13] [INFO ] Load time of PNML (sax parser for PT used): 540 ms
[2023-03-24 05:47:13] [INFO ] Transformed 474 places.
[2023-03-24 05:47:13] [INFO ] Transformed 11760 transitions.
[2023-03-24 05:47:13] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 694 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 133 ms.
[2023-03-24 05:47:13] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 05:47:13] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 471 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 56 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
[2023-03-24 05:47:13] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-24 05:47:13] [INFO ] Computed 72 place invariants in 85 ms
[2023-03-24 05:47:14] [INFO ] Dead Transitions using invariants and state equation in 1350 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 05:47:14] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2023-03-24 05:47:14] [INFO ] Computed 72 place invariants in 25 ms
[2023-03-24 05:47:15] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-24 05:47:15] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 05:47:15] [INFO ] Invariant cache hit.
[2023-03-24 05:47:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:47:15] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1035/1650 transitions.
Applied a total of 0 rules in 15 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2128 ms. Remains : 474/474 places, 1035/1650 transitions.
Support contains 471 out of 474 places after structural reductions.
[2023-03-24 05:47:16] [INFO ] Flatten gal took : 257 ms
[2023-03-24 05:47:16] [INFO ] Flatten gal took : 180 ms
[2023-03-24 05:47:17] [INFO ] Input system was already deterministic with 1035 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 1582 ms. (steps per millisecond=6 ) properties (out of 92) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 85) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 85) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 85) seen :17
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :4
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=19 ) properties (out of 64) seen :5
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8 ) properties (out of 59) seen :2
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 57) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 48) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 47) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 37) seen :0
Running SMT prover for 37 properties.
[2023-03-24 05:47:20] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
[2023-03-24 05:47:20] [INFO ] Invariant cache hit.
[2023-03-24 05:47:22] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2023-03-24 05:47:22] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2023-03-24 05:47:23] [INFO ] After 1086ms SMT Verify possible using state equation in real domain returned unsat :12 sat :1 real:24
[2023-03-24 05:47:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:47:23] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :12 sat :1 real:24
[2023-03-24 05:47:23] [INFO ] After 159ms SMT Verify possible using trap constraints in real domain returned unsat :12 sat :1 real:24
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-24 05:47:23] [INFO ] After 1841ms SMT Verify possible using all constraints in real domain returned unsat :12 sat :1 real:24
[2023-03-24 05:47:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 05:47:24] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 23 ms returned sat
[2023-03-24 05:47:25] [INFO ] After 1557ms SMT Verify possible using state equation in natural domain returned unsat :31 sat :6
[2023-03-24 05:47:26] [INFO ] After 1057ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :31 sat :6
[2023-03-24 05:47:27] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 1 ms to minimize.
[2023-03-24 05:47:27] [INFO ] Deduced a trap composed of 223 places in 259 ms of which 1 ms to minimize.
[2023-03-24 05:47:28] [INFO ] Deduced a trap composed of 207 places in 282 ms of which 1 ms to minimize.
[2023-03-24 05:47:28] [INFO ] Deduced a trap composed of 213 places in 297 ms of which 1 ms to minimize.
[2023-03-24 05:47:28] [INFO ] Deduced a trap composed of 213 places in 276 ms of which 1 ms to minimize.
[2023-03-24 05:47:29] [INFO ] Deduced a trap composed of 213 places in 281 ms of which 1 ms to minimize.
[2023-03-24 05:47:29] [INFO ] Deduced a trap composed of 219 places in 278 ms of which 1 ms to minimize.
[2023-03-24 05:47:29] [INFO ] Deduced a trap composed of 221 places in 300 ms of which 1 ms to minimize.
[2023-03-24 05:47:30] [INFO ] Deduced a trap composed of 219 places in 281 ms of which 3 ms to minimize.
[2023-03-24 05:47:30] [INFO ] Deduced a trap composed of 215 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:47:30] [INFO ] Deduced a trap composed of 227 places in 290 ms of which 0 ms to minimize.
[2023-03-24 05:47:31] [INFO ] Deduced a trap composed of 221 places in 290 ms of which 0 ms to minimize.
[2023-03-24 05:47:31] [INFO ] Deduced a trap composed of 223 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:47:31] [INFO ] Deduced a trap composed of 211 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:47:32] [INFO ] Deduced a trap composed of 215 places in 292 ms of which 1 ms to minimize.
[2023-03-24 05:47:32] [INFO ] Deduced a trap composed of 223 places in 319 ms of which 0 ms to minimize.
[2023-03-24 05:47:32] [INFO ] Deduced a trap composed of 217 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:47:33] [INFO ] Deduced a trap composed of 215 places in 336 ms of which 1 ms to minimize.
[2023-03-24 05:47:33] [INFO ] Deduced a trap composed of 233 places in 284 ms of which 0 ms to minimize.
[2023-03-24 05:47:33] [INFO ] Deduced a trap composed of 221 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:47:34] [INFO ] Deduced a trap composed of 219 places in 292 ms of which 1 ms to minimize.
[2023-03-24 05:47:34] [INFO ] Deduced a trap composed of 229 places in 284 ms of which 1 ms to minimize.
[2023-03-24 05:47:34] [INFO ] Deduced a trap composed of 223 places in 287 ms of which 1 ms to minimize.
[2023-03-24 05:47:35] [INFO ] Deduced a trap composed of 219 places in 289 ms of which 0 ms to minimize.
[2023-03-24 05:47:35] [INFO ] Deduced a trap composed of 223 places in 281 ms of which 1 ms to minimize.
[2023-03-24 05:47:35] [INFO ] Deduced a trap composed of 229 places in 277 ms of which 1 ms to minimize.
[2023-03-24 05:47:36] [INFO ] Deduced a trap composed of 227 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:47:36] [INFO ] Deduced a trap composed of 229 places in 286 ms of which 1 ms to minimize.
[2023-03-24 05:47:36] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 0 ms to minimize.
[2023-03-24 05:47:37] [INFO ] Deduced a trap composed of 235 places in 276 ms of which 1 ms to minimize.
[2023-03-24 05:47:37] [INFO ] Deduced a trap composed of 217 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:47:38] [INFO ] Deduced a trap composed of 219 places in 277 ms of which 1 ms to minimize.
[2023-03-24 05:47:38] [INFO ] Deduced a trap composed of 215 places in 284 ms of which 1 ms to minimize.
[2023-03-24 05:47:38] [INFO ] Deduced a trap composed of 227 places in 280 ms of which 1 ms to minimize.
[2023-03-24 05:47:39] [INFO ] Deduced a trap composed of 209 places in 281 ms of which 1 ms to minimize.
[2023-03-24 05:47:39] [INFO ] Deduced a trap composed of 223 places in 271 ms of which 0 ms to minimize.
[2023-03-24 05:47:39] [INFO ] Deduced a trap composed of 225 places in 282 ms of which 0 ms to minimize.
[2023-03-24 05:47:40] [INFO ] Deduced a trap composed of 221 places in 290 ms of which 0 ms to minimize.
[2023-03-24 05:47:40] [INFO ] Deduced a trap composed of 217 places in 295 ms of which 1 ms to minimize.
[2023-03-24 05:47:40] [INFO ] Deduced a trap composed of 229 places in 279 ms of which 1 ms to minimize.
[2023-03-24 05:47:41] [INFO ] Deduced a trap composed of 213 places in 289 ms of which 1 ms to minimize.
[2023-03-24 05:47:41] [INFO ] Deduced a trap composed of 211 places in 279 ms of which 1 ms to minimize.
[2023-03-24 05:47:42] [INFO ] Deduced a trap composed of 225 places in 284 ms of which 0 ms to minimize.
[2023-03-24 05:47:42] [INFO ] Deduced a trap composed of 213 places in 283 ms of which 1 ms to minimize.
[2023-03-24 05:47:42] [INFO ] Deduced a trap composed of 223 places in 283 ms of which 1 ms to minimize.
[2023-03-24 05:47:43] [INFO ] Deduced a trap composed of 219 places in 281 ms of which 1 ms to minimize.
[2023-03-24 05:47:43] [INFO ] Deduced a trap composed of 215 places in 273 ms of which 1 ms to minimize.
[2023-03-24 05:47:43] [INFO ] Deduced a trap composed of 211 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:47:44] [INFO ] Deduced a trap composed of 227 places in 278 ms of which 0 ms to minimize.
[2023-03-24 05:47:44] [INFO ] Deduced a trap composed of 217 places in 283 ms of which 1 ms to minimize.
[2023-03-24 05:47:44] [INFO ] Deduced a trap composed of 225 places in 287 ms of which 1 ms to minimize.
[2023-03-24 05:47:45] [INFO ] Deduced a trap composed of 217 places in 289 ms of which 0 ms to minimize.
[2023-03-24 05:47:48] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 21664 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:47:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:47:48] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1 real:24
Fused 37 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 39 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 464 transition count 1012
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 56 place count 441 transition count 1012
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 56 place count 441 transition count 988
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 104 place count 417 transition count 988
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 416 transition count 987
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 416 transition count 987
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 414 transition count 985
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 414 transition count 984
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 413 transition count 984
Applied a total of 112 rules in 207 ms. Remains 413 /474 variables (removed 61) and now considering 984/1035 (removed 51) transitions.
[2023-03-24 05:47:48] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-24 05:47:48] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-24 05:47:49] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 413/474 places, 984/1035 transitions.
Incomplete random walk after 10000 steps, including 669 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-24 05:47:49] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
[2023-03-24 05:47:49] [INFO ] Invariant cache hit.
[2023-03-24 05:47:49] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2023-03-24 05:47:49] [INFO ] [Real]Absence check using 46 positive and 16 generalized place invariants in 21 ms returned sat
[2023-03-24 05:47:49] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:47:49] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2023-03-24 05:47:49] [INFO ] [Nat]Absence check using 46 positive and 16 generalized place invariants in 14 ms returned sat
[2023-03-24 05:47:50] [INFO ] After 287ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:47:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:47:50] [INFO ] After 361ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:47:50] [INFO ] Deduced a trap composed of 169 places in 272 ms of which 1 ms to minimize.
[2023-03-24 05:47:51] [INFO ] Deduced a trap composed of 171 places in 257 ms of which 0 ms to minimize.
[2023-03-24 05:47:51] [INFO ] Deduced a trap composed of 161 places in 237 ms of which 0 ms to minimize.
[2023-03-24 05:47:51] [INFO ] Deduced a trap composed of 163 places in 278 ms of which 2 ms to minimize.
[2023-03-24 05:47:52] [INFO ] Deduced a trap composed of 167 places in 282 ms of which 1 ms to minimize.
[2023-03-24 05:47:52] [INFO ] Deduced a trap composed of 165 places in 266 ms of which 1 ms to minimize.
[2023-03-24 05:47:52] [INFO ] Deduced a trap composed of 171 places in 256 ms of which 1 ms to minimize.
[2023-03-24 05:47:53] [INFO ] Deduced a trap composed of 169 places in 251 ms of which 1 ms to minimize.
[2023-03-24 05:47:53] [INFO ] Deduced a trap composed of 175 places in 248 ms of which 1 ms to minimize.
[2023-03-24 05:47:53] [INFO ] Deduced a trap composed of 173 places in 251 ms of which 1 ms to minimize.
[2023-03-24 05:47:54] [INFO ] Deduced a trap composed of 165 places in 280 ms of which 2 ms to minimize.
[2023-03-24 05:47:54] [INFO ] Deduced a trap composed of 169 places in 267 ms of which 0 ms to minimize.
[2023-03-24 05:47:54] [INFO ] Deduced a trap composed of 161 places in 267 ms of which 0 ms to minimize.
[2023-03-24 05:47:55] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 2 ms to minimize.
[2023-03-24 05:47:55] [INFO ] Deduced a trap composed of 167 places in 253 ms of which 1 ms to minimize.
[2023-03-24 05:47:55] [INFO ] Deduced a trap composed of 179 places in 253 ms of which 1 ms to minimize.
[2023-03-24 05:47:55] [INFO ] Deduced a trap composed of 175 places in 272 ms of which 1 ms to minimize.
[2023-03-24 05:47:56] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 0 ms to minimize.
[2023-03-24 05:47:56] [INFO ] Deduced a trap composed of 175 places in 281 ms of which 1 ms to minimize.
[2023-03-24 05:47:57] [INFO ] Deduced a trap composed of 177 places in 282 ms of which 0 ms to minimize.
[2023-03-24 05:47:57] [INFO ] Deduced a trap composed of 167 places in 255 ms of which 0 ms to minimize.
[2023-03-24 05:47:57] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 1 ms to minimize.
[2023-03-24 05:47:58] [INFO ] Deduced a trap composed of 177 places in 269 ms of which 0 ms to minimize.
[2023-03-24 05:47:58] [INFO ] Deduced a trap composed of 161 places in 277 ms of which 0 ms to minimize.
[2023-03-24 05:47:58] [INFO ] Deduced a trap composed of 171 places in 273 ms of which 0 ms to minimize.
[2023-03-24 05:47:58] [INFO ] Deduced a trap composed of 163 places in 265 ms of which 0 ms to minimize.
[2023-03-24 05:47:59] [INFO ] Deduced a trap composed of 165 places in 257 ms of which 0 ms to minimize.
[2023-03-24 05:47:59] [INFO ] Deduced a trap composed of 167 places in 247 ms of which 1 ms to minimize.
[2023-03-24 05:48:00] [INFO ] Deduced a trap composed of 171 places in 267 ms of which 1 ms to minimize.
[2023-03-24 05:48:00] [INFO ] Deduced a trap composed of 163 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:00] [INFO ] Deduced a trap composed of 169 places in 263 ms of which 0 ms to minimize.
[2023-03-24 05:48:01] [INFO ] Deduced a trap composed of 177 places in 274 ms of which 1 ms to minimize.
[2023-03-24 05:48:01] [INFO ] Deduced a trap composed of 173 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:01] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 0 ms to minimize.
[2023-03-24 05:48:01] [INFO ] Deduced a trap composed of 163 places in 254 ms of which 0 ms to minimize.
[2023-03-24 05:48:02] [INFO ] Deduced a trap composed of 179 places in 285 ms of which 1 ms to minimize.
[2023-03-24 05:48:02] [INFO ] Deduced a trap composed of 163 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:48:03] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:03] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 0 ms to minimize.
[2023-03-24 05:48:04] [INFO ] Deduced a trap composed of 173 places in 267 ms of which 0 ms to minimize.
[2023-03-24 05:48:04] [INFO ] Deduced a trap composed of 161 places in 264 ms of which 0 ms to minimize.
[2023-03-24 05:48:04] [INFO ] Deduced a trap composed of 169 places in 263 ms of which 0 ms to minimize.
[2023-03-24 05:48:05] [INFO ] Deduced a trap composed of 169 places in 259 ms of which 0 ms to minimize.
[2023-03-24 05:48:05] [INFO ] Deduced a trap composed of 171 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:05] [INFO ] Deduced a trap composed of 187 places in 256 ms of which 1 ms to minimize.
[2023-03-24 05:48:06] [INFO ] Deduced a trap composed of 165 places in 256 ms of which 0 ms to minimize.
[2023-03-24 05:48:06] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:06] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 0 ms to minimize.
[2023-03-24 05:48:07] [INFO ] Deduced a trap composed of 172 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:07] [INFO ] Deduced a trap composed of 183 places in 271 ms of which 1 ms to minimize.
[2023-03-24 05:48:07] [INFO ] Deduced a trap composed of 163 places in 259 ms of which 0 ms to minimize.
[2023-03-24 05:48:08] [INFO ] Deduced a trap composed of 171 places in 258 ms of which 1 ms to minimize.
[2023-03-24 05:48:08] [INFO ] Deduced a trap composed of 173 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:48:08] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 1 ms to minimize.
[2023-03-24 05:48:09] [INFO ] Deduced a trap composed of 167 places in 264 ms of which 1 ms to minimize.
[2023-03-24 05:48:09] [INFO ] Deduced a trap composed of 173 places in 258 ms of which 0 ms to minimize.
[2023-03-24 05:48:09] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 0 ms to minimize.
[2023-03-24 05:48:10] [INFO ] Deduced a trap composed of 171 places in 263 ms of which 1 ms to minimize.
[2023-03-24 05:48:10] [INFO ] Deduced a trap composed of 179 places in 250 ms of which 0 ms to minimize.
[2023-03-24 05:48:10] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 1 ms to minimize.
[2023-03-24 05:48:11] [INFO ] Deduced a trap composed of 161 places in 258 ms of which 1 ms to minimize.
[2023-03-24 05:48:11] [INFO ] Deduced a trap composed of 159 places in 254 ms of which 1 ms to minimize.
[2023-03-24 05:48:11] [INFO ] Deduced a trap composed of 173 places in 256 ms of which 1 ms to minimize.
[2023-03-24 05:48:11] [INFO ] Deduced a trap composed of 167 places in 247 ms of which 0 ms to minimize.
[2023-03-24 05:48:12] [INFO ] Deduced a trap composed of 175 places in 249 ms of which 0 ms to minimize.
[2023-03-24 05:48:12] [INFO ] Deduced a trap composed of 165 places in 264 ms of which 0 ms to minimize.
[2023-03-24 05:48:12] [INFO ] Deduced a trap composed of 175 places in 261 ms of which 1 ms to minimize.
[2023-03-24 05:48:13] [INFO ] Deduced a trap composed of 171 places in 262 ms of which 1 ms to minimize.
[2023-03-24 05:48:13] [INFO ] Deduced a trap composed of 167 places in 245 ms of which 0 ms to minimize.
[2023-03-24 05:48:13] [INFO ] Deduced a trap composed of 163 places in 257 ms of which 1 ms to minimize.
[2023-03-24 05:48:14] [INFO ] Deduced a trap composed of 175 places in 271 ms of which 1 ms to minimize.
[2023-03-24 05:48:14] [INFO ] Deduced a trap composed of 171 places in 254 ms of which 0 ms to minimize.
[2023-03-24 05:48:14] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 24235 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-24 05:48:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 05:48:14] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 984/984 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 413 transition count 981
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 410 transition count 981
Applied a total of 6 rules in 46 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 10000 steps, including 737 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 380872 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 380872 steps, saw 62559 distinct states, run finished after 3004 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 05:48:18] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-24 05:48:18] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-24 05:48:18] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 05:48:18] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 20 ms returned sat
[2023-03-24 05:48:18] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:48:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-24 05:48:18] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-24 05:48:19] [INFO ] After 766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:48:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:48:19] [INFO ] After 224ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 05:48:19] [INFO ] Deduced a trap composed of 160 places in 282 ms of which 1 ms to minimize.
[2023-03-24 05:48:19] [INFO ] Deduced a trap composed of 187 places in 294 ms of which 1 ms to minimize.
[2023-03-24 05:48:20] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 1 ms to minimize.
[2023-03-24 05:48:20] [INFO ] Deduced a trap composed of 164 places in 279 ms of which 1 ms to minimize.
[2023-03-24 05:48:20] [INFO ] Deduced a trap composed of 172 places in 262 ms of which 0 ms to minimize.
[2023-03-24 05:48:21] [INFO ] Deduced a trap composed of 186 places in 274 ms of which 0 ms to minimize.
[2023-03-24 05:48:21] [INFO ] Deduced a trap composed of 162 places in 276 ms of which 0 ms to minimize.
[2023-03-24 05:48:21] [INFO ] Deduced a trap composed of 168 places in 253 ms of which 0 ms to minimize.
[2023-03-24 05:48:22] [INFO ] Deduced a trap composed of 173 places in 263 ms of which 1 ms to minimize.
[2023-03-24 05:48:22] [INFO ] Deduced a trap composed of 160 places in 287 ms of which 0 ms to minimize.
[2023-03-24 05:48:22] [INFO ] Deduced a trap composed of 169 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:48:23] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 0 ms to minimize.
[2023-03-24 05:48:23] [INFO ] Deduced a trap composed of 185 places in 261 ms of which 0 ms to minimize.
[2023-03-24 05:48:24] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 1 ms to minimize.
[2023-03-24 05:48:24] [INFO ] Deduced a trap composed of 158 places in 257 ms of which 1 ms to minimize.
[2023-03-24 05:48:24] [INFO ] Deduced a trap composed of 166 places in 272 ms of which 0 ms to minimize.
[2023-03-24 05:48:24] [INFO ] Deduced a trap composed of 178 places in 257 ms of which 1 ms to minimize.
[2023-03-24 05:48:25] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 2 ms to minimize.
[2023-03-24 05:48:25] [INFO ] Deduced a trap composed of 158 places in 268 ms of which 0 ms to minimize.
[2023-03-24 05:48:25] [INFO ] Deduced a trap composed of 166 places in 263 ms of which 1 ms to minimize.
[2023-03-24 05:48:26] [INFO ] Deduced a trap composed of 168 places in 257 ms of which 0 ms to minimize.
[2023-03-24 05:48:26] [INFO ] Deduced a trap composed of 156 places in 255 ms of which 0 ms to minimize.
[2023-03-24 05:48:27] [INFO ] Deduced a trap composed of 160 places in 249 ms of which 0 ms to minimize.
[2023-03-24 05:48:27] [INFO ] Deduced a trap composed of 177 places in 260 ms of which 1 ms to minimize.
[2023-03-24 05:48:27] [INFO ] Deduced a trap composed of 164 places in 250 ms of which 0 ms to minimize.
[2023-03-24 05:48:28] [INFO ] Deduced a trap composed of 168 places in 247 ms of which 1 ms to minimize.
[2023-03-24 05:48:28] [INFO ] Deduced a trap composed of 164 places in 265 ms of which 0 ms to minimize.
[2023-03-24 05:48:28] [INFO ] Deduced a trap composed of 181 places in 256 ms of which 1 ms to minimize.
[2023-03-24 05:48:29] [INFO ] Deduced a trap composed of 188 places in 255 ms of which 0 ms to minimize.
[2023-03-24 05:48:30] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:48:30] [INFO ] Deduced a trap composed of 168 places in 273 ms of which 0 ms to minimize.
[2023-03-24 05:48:30] [INFO ] Deduced a trap composed of 165 places in 253 ms of which 0 ms to minimize.
[2023-03-24 05:48:31] [INFO ] Deduced a trap composed of 162 places in 260 ms of which 0 ms to minimize.
[2023-03-24 05:48:31] [INFO ] Deduced a trap composed of 158 places in 254 ms of which 1 ms to minimize.
[2023-03-24 05:48:32] [INFO ] Deduced a trap composed of 163 places in 257 ms of which 1 ms to minimize.
[2023-03-24 05:48:32] [INFO ] Deduced a trap composed of 188 places in 249 ms of which 0 ms to minimize.
[2023-03-24 05:48:33] [INFO ] Deduced a trap composed of 169 places in 242 ms of which 0 ms to minimize.
[2023-03-24 05:48:33] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 1 ms to minimize.
[2023-03-24 05:48:34] [INFO ] Deduced a trap composed of 162 places in 247 ms of which 0 ms to minimize.
[2023-03-24 05:48:34] [INFO ] Deduced a trap composed of 166 places in 275 ms of which 1 ms to minimize.
[2023-03-24 05:48:34] [INFO ] Deduced a trap composed of 175 places in 254 ms of which 0 ms to minimize.
[2023-03-24 05:48:35] [INFO ] Deduced a trap composed of 166 places in 255 ms of which 0 ms to minimize.
[2023-03-24 05:48:35] [INFO ] Deduced a trap composed of 175 places in 268 ms of which 1 ms to minimize.
[2023-03-24 05:48:36] [INFO ] Deduced a trap composed of 160 places in 257 ms of which 1 ms to minimize.
[2023-03-24 05:48:36] [INFO ] Deduced a trap composed of 181 places in 257 ms of which 0 ms to minimize.
[2023-03-24 05:48:36] [INFO ] Deduced a trap composed of 166 places in 258 ms of which 0 ms to minimize.
[2023-03-24 05:48:37] [INFO ] Deduced a trap composed of 180 places in 267 ms of which 1 ms to minimize.
[2023-03-24 05:48:37] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 1 ms to minimize.
[2023-03-24 05:48:38] [INFO ] Deduced a trap composed of 162 places in 250 ms of which 1 ms to minimize.
[2023-03-24 05:48:39] [INFO ] Deduced a trap composed of 158 places in 253 ms of which 0 ms to minimize.
[2023-03-24 05:48:40] [INFO ] Deduced a trap composed of 164 places in 252 ms of which 1 ms to minimize.
[2023-03-24 05:48:43] [INFO ] Deduced a trap composed of 158 places in 266 ms of which 1 ms to minimize.
[2023-03-24 05:48:43] [INFO ] Trap strengthening (SAT) tested/added 52/52 trap constraints in 23917 ms
[2023-03-24 05:48:43] [INFO ] After 24144ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:48:43] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-24 05:48:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 05:48:43] [INFO ] Invariant cache hit.
[2023-03-24 05:48:43] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-24 05:48:43] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 05:48:43] [INFO ] Invariant cache hit.
[2023-03-24 05:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 05:48:47] [INFO ] Implicit Places using invariants and state equation in 4153 ms returned []
Implicit Place search using SMT with State Equation took 4655 ms to find 0 implicit places.
[2023-03-24 05:48:48] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-24 05:48:48] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-24 05:48:48] [INFO ] Invariant cache hit.
[2023-03-24 05:48:48] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5289 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 106 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-24 05:48:48] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-24 05:48:48] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-24 05:48:48] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-24 05:48:49] [INFO ] After 569ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-24 05:48:49] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:48:49] [INFO ] Deduced a trap composed of 180 places in 211 ms of which 1 ms to minimize.
[2023-03-24 05:48:50] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-24 05:48:50] [INFO ] Deduced a trap composed of 180 places in 210 ms of which 0 ms to minimize.
[2023-03-24 05:48:50] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-24 05:48:50] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2023-03-24 05:48:51] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-24 05:48:51] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-24 05:48:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1989 ms
[2023-03-24 05:48:51] [INFO ] After 2601ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:48:51] [INFO ] After 2694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 05:48:51] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-24 05:48:51] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-24 05:48:51] [INFO ] After 340ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 05:48:52] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:48:52] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 0 ms to minimize.
[2023-03-24 05:48:52] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:48:52] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:48:53] [INFO ] Deduced a trap composed of 152 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:48:53] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:48:53] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:48:53] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:48:54] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:48:54] [INFO ] Deduced a trap composed of 166 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:48:54] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 1 ms to minimize.
[2023-03-24 05:48:54] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:48:55] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:48:55] [INFO ] Deduced a trap composed of 166 places in 246 ms of which 0 ms to minimize.
[2023-03-24 05:48:55] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:48:55] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:48:56] [INFO ] Deduced a trap composed of 161 places in 220 ms of which 1 ms to minimize.
[2023-03-24 05:48:56] [INFO ] Deduced a trap composed of 158 places in 211 ms of which 0 ms to minimize.
[2023-03-24 05:48:57] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 1 ms to minimize.
[2023-03-24 05:48:57] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:48:57] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:48:57] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:48:58] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2023-03-24 05:48:58] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-24 05:48:58] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 0 ms to minimize.
[2023-03-24 05:48:59] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:48:59] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:48:59] [INFO ] Deduced a trap composed of 154 places in 220 ms of which 1 ms to minimize.
[2023-03-24 05:49:00] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:00] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:00] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-24 05:49:00] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 0 ms to minimize.
[2023-03-24 05:49:01] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2023-03-24 05:49:01] [INFO ] Deduced a trap composed of 160 places in 236 ms of which 1 ms to minimize.
[2023-03-24 05:49:01] [INFO ] Deduced a trap composed of 156 places in 236 ms of which 0 ms to minimize.
[2023-03-24 05:49:02] [INFO ] Deduced a trap composed of 158 places in 233 ms of which 0 ms to minimize.
[2023-03-24 05:49:03] [INFO ] Deduced a trap composed of 160 places in 238 ms of which 1 ms to minimize.
[2023-03-24 05:49:03] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:03] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:49:03] [INFO ] Deduced a trap composed of 157 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:04] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:04] [INFO ] Deduced a trap composed of 156 places in 234 ms of which 1 ms to minimize.
[2023-03-24 05:49:04] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:04] [INFO ] Deduced a trap composed of 166 places in 236 ms of which 1 ms to minimize.
[2023-03-24 05:49:05] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:49:05] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:49:05] [INFO ] Deduced a trap composed of 158 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:49:05] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-24 05:49:06] [INFO ] Deduced a trap composed of 154 places in 221 ms of which 1 ms to minimize.
[2023-03-24 05:49:06] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2023-03-24 05:49:06] [INFO ] Deduced a trap composed of 158 places in 224 ms of which 1 ms to minimize.
[2023-03-24 05:49:07] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:07] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:07] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:07] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-24 05:49:08] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:49:08] [INFO ] Deduced a trap composed of 154 places in 218 ms of which 0 ms to minimize.
[2023-03-24 05:49:08] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:49:08] [INFO ] Deduced a trap composed of 151 places in 222 ms of which 1 ms to minimize.
[2023-03-24 05:49:09] [INFO ] Deduced a trap composed of 156 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:49:10] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:49:10] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:11] [INFO ] Deduced a trap composed of 168 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:11] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 2 ms to minimize.
[2023-03-24 05:49:11] [INFO ] Deduced a trap composed of 169 places in 221 ms of which 0 ms to minimize.
[2023-03-24 05:49:12] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2023-03-24 05:49:12] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 1 ms to minimize.
[2023-03-24 05:49:12] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2023-03-24 05:49:12] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:13] [INFO ] Deduced a trap composed of 152 places in 235 ms of which 1 ms to minimize.
[2023-03-24 05:49:13] [INFO ] Deduced a trap composed of 164 places in 226 ms of which 3 ms to minimize.
[2023-03-24 05:49:13] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:14] [INFO ] Deduced a trap composed of 156 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:49:14] [INFO ] Deduced a trap composed of 154 places in 212 ms of which 0 ms to minimize.
[2023-03-24 05:49:14] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 1 ms to minimize.
[2023-03-24 05:49:15] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:15] [INFO ] Deduced a trap composed of 164 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:49:15] [INFO ] Deduced a trap composed of 166 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:49:16] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 0 ms to minimize.
[2023-03-24 05:49:16] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:49:17] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 1 ms to minimize.
[2023-03-24 05:49:17] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-24 05:49:17] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:17] [INFO ] Deduced a trap composed of 159 places in 230 ms of which 0 ms to minimize.
[2023-03-24 05:49:18] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:18] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2023-03-24 05:49:18] [INFO ] Deduced a trap composed of 158 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:49:18] [INFO ] Deduced a trap composed of 154 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:19] [INFO ] Deduced a trap composed of 150 places in 225 ms of which 1 ms to minimize.
[2023-03-24 05:49:19] [INFO ] Deduced a trap composed of 164 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:49:19] [INFO ] Deduced a trap composed of 158 places in 235 ms of which 1 ms to minimize.
[2023-03-24 05:49:19] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:20] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:49:20] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:20] [INFO ] Deduced a trap composed of 156 places in 221 ms of which 1 ms to minimize.
[2023-03-24 05:49:21] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:22] [INFO ] Deduced a trap composed of 170 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:22] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:22] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:23] [INFO ] Deduced a trap composed of 154 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:49:23] [INFO ] Deduced a trap composed of 162 places in 233 ms of which 0 ms to minimize.
[2023-03-24 05:49:23] [INFO ] Deduced a trap composed of 163 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:23] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 1 ms to minimize.
[2023-03-24 05:49:24] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 1 ms to minimize.
[2023-03-24 05:49:24] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 0 ms to minimize.
[2023-03-24 05:49:26] [INFO ] Deduced a trap composed of 158 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:27] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 0 ms to minimize.
[2023-03-24 05:49:27] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-24 05:49:27] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 0 ms to minimize.
[2023-03-24 05:49:27] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 1 ms to minimize.
[2023-03-24 05:49:28] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:28] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:49:28] [INFO ] Deduced a trap composed of 180 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:49:29] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 0 ms to minimize.
[2023-03-24 05:49:29] [INFO ] Deduced a trap composed of 165 places in 236 ms of which 0 ms to minimize.
[2023-03-24 05:49:29] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:30] [INFO ] Deduced a trap composed of 161 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:49:30] [INFO ] Deduced a trap composed of 150 places in 240 ms of which 1 ms to minimize.
[2023-03-24 05:49:31] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:31] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 1 ms to minimize.
[2023-03-24 05:49:31] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 1 ms to minimize.
[2023-03-24 05:49:32] [INFO ] Deduced a trap composed of 162 places in 234 ms of which 0 ms to minimize.
[2023-03-24 05:49:32] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:49:32] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:32] [INFO ] Deduced a trap composed of 156 places in 217 ms of which 1 ms to minimize.
[2023-03-24 05:49:33] [INFO ] Deduced a trap composed of 158 places in 241 ms of which 1 ms to minimize.
[2023-03-24 05:49:33] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:49:33] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-24 05:49:33] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:34] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:49:34] [INFO ] Deduced a trap composed of 160 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:49:34] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2023-03-24 05:49:34] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:35] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 0 ms to minimize.
[2023-03-24 05:49:35] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:49:35] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:36] [INFO ] Deduced a trap composed of 174 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:49:36] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 0 ms to minimize.
[2023-03-24 05:49:36] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:49:36] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:49:37] [INFO ] Deduced a trap composed of 158 places in 244 ms of which 0 ms to minimize.
[2023-03-24 05:49:37] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:37] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:37] [INFO ] Deduced a trap composed of 160 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:38] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:38] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:49:38] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:39] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 0 ms to minimize.
[2023-03-24 05:49:39] [INFO ] Deduced a trap composed of 174 places in 237 ms of which 0 ms to minimize.
[2023-03-24 05:49:39] [INFO ] Deduced a trap composed of 168 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:39] [INFO ] Deduced a trap composed of 158 places in 218 ms of which 0 ms to minimize.
[2023-03-24 05:49:40] [INFO ] Deduced a trap composed of 156 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:49:40] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2023-03-24 05:49:40] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 1 ms to minimize.
[2023-03-24 05:49:40] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 0 ms to minimize.
[2023-03-24 05:49:41] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 0 ms to minimize.
[2023-03-24 05:49:42] [INFO ] Deduced a trap composed of 158 places in 239 ms of which 0 ms to minimize.
[2023-03-24 05:49:43] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:44] [INFO ] Deduced a trap composed of 168 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:49:44] [INFO ] Deduced a trap composed of 156 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:44] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 0 ms to minimize.
[2023-03-24 05:49:47] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-24 05:49:47] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 0 ms to minimize.
[2023-03-24 05:49:48] [INFO ] Deduced a trap composed of 168 places in 218 ms of which 1 ms to minimize.
[2023-03-24 05:49:48] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2023-03-24 05:49:48] [INFO ] Deduced a trap composed of 170 places in 217 ms of which 0 ms to minimize.
[2023-03-24 05:49:48] [INFO ] Deduced a trap composed of 171 places in 222 ms of which 1 ms to minimize.
[2023-03-24 05:49:49] [INFO ] Deduced a trap composed of 165 places in 234 ms of which 1 ms to minimize.
[2023-03-24 05:49:49] [INFO ] Deduced a trap composed of 160 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:49:49] [INFO ] Deduced a trap composed of 164 places in 237 ms of which 0 ms to minimize.
[2023-03-24 05:49:49] [INFO ] Deduced a trap composed of 160 places in 226 ms of which 0 ms to minimize.
[2023-03-24 05:49:50] [INFO ] Deduced a trap composed of 155 places in 244 ms of which 1 ms to minimize.
[2023-03-24 05:49:50] [INFO ] Deduced a trap composed of 159 places in 244 ms of which 1 ms to minimize.
[2023-03-24 05:49:50] [INFO ] Deduced a trap composed of 161 places in 235 ms of which 0 ms to minimize.
[2023-03-24 05:49:51] [INFO ] Deduced a trap composed of 152 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:49:51] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 1 ms to minimize.
[2023-03-24 05:49:51] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-24 05:49:52] [INFO ] Deduced a trap composed of 154 places in 234 ms of which 1 ms to minimize.
[2023-03-24 05:49:52] [INFO ] Deduced a trap composed of 171 places in 216 ms of which 0 ms to minimize.
[2023-03-24 05:49:53] [INFO ] Deduced a trap composed of 167 places in 233 ms of which 0 ms to minimize.
[2023-03-24 05:49:53] [INFO ] Deduced a trap composed of 163 places in 234 ms of which 1 ms to minimize.
[2023-03-24 05:49:53] [INFO ] Deduced a trap composed of 162 places in 231 ms of which 1 ms to minimize.
[2023-03-24 05:49:53] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:49:54] [INFO ] Deduced a trap composed of 161 places in 231 ms of which 1 ms to minimize.
[2023-03-24 05:49:54] [INFO ] Deduced a trap composed of 158 places in 225 ms of which 1 ms to minimize.
[2023-03-24 05:49:55] [INFO ] Deduced a trap composed of 158 places in 216 ms of which 1 ms to minimize.
[2023-03-24 05:49:56] [INFO ] Deduced a trap composed of 172 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:56] [INFO ] Deduced a trap composed of 164 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:49:56] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 2 ms to minimize.
[2023-03-24 05:49:57] [INFO ] Deduced a trap composed of 166 places in 226 ms of which 1 ms to minimize.
[2023-03-24 05:49:57] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:57] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 1 ms to minimize.
[2023-03-24 05:49:58] [INFO ] Deduced a trap composed of 152 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:49:58] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:49:58] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:49:58] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:49:59] [INFO ] Deduced a trap composed of 166 places in 235 ms of which 1 ms to minimize.
[2023-03-24 05:49:59] [INFO ] Deduced a trap composed of 157 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:50:00] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2023-03-24 05:50:00] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:50:01] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 0 ms to minimize.
[2023-03-24 05:50:03] [INFO ] Deduced a trap composed of 169 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:50:03] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 1 ms to minimize.
[2023-03-24 05:50:04] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2023-03-24 05:50:04] [INFO ] Deduced a trap composed of 178 places in 219 ms of which 0 ms to minimize.
[2023-03-24 05:50:04] [INFO ] Deduced a trap composed of 165 places in 220 ms of which 0 ms to minimize.
[2023-03-24 05:50:05] [INFO ] Deduced a trap composed of 182 places in 213 ms of which 0 ms to minimize.
[2023-03-24 05:50:05] [INFO ] Deduced a trap composed of 177 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:50:05] [INFO ] Deduced a trap composed of 162 places in 222 ms of which 1 ms to minimize.
[2023-03-24 05:50:06] [INFO ] Deduced a trap composed of 177 places in 220 ms of which 1 ms to minimize.
[2023-03-24 05:50:06] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:50:06] [INFO ] Deduced a trap composed of 152 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:50:07] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 0 ms to minimize.
[2023-03-24 05:50:07] [INFO ] Deduced a trap composed of 166 places in 233 ms of which 1 ms to minimize.
[2023-03-24 05:50:07] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:50:08] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 0 ms to minimize.
[2023-03-24 05:50:08] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:50:08] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:50:09] [INFO ] Deduced a trap composed of 162 places in 224 ms of which 0 ms to minimize.
[2023-03-24 05:50:09] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:50:09] [INFO ] Deduced a trap composed of 164 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:50:10] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 0 ms to minimize.
[2023-03-24 05:50:10] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:50:12] [INFO ] Deduced a trap composed of 181 places in 213 ms of which 0 ms to minimize.
[2023-03-24 05:50:12] [INFO ] Deduced a trap composed of 179 places in 242 ms of which 0 ms to minimize.
[2023-03-24 05:50:14] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 0 ms to minimize.
[2023-03-24 05:50:14] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 1 ms to minimize.
[2023-03-24 05:50:14] [INFO ] Deduced a trap composed of 154 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:50:15] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 0 ms to minimize.
[2023-03-24 05:50:15] [INFO ] Deduced a trap composed of 160 places in 234 ms of which 0 ms to minimize.
[2023-03-24 05:50:15] [INFO ] Deduced a trap composed of 154 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:50:15] [INFO ] Deduced a trap composed of 156 places in 222 ms of which 0 ms to minimize.
[2023-03-24 05:50:16] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:50:16] [INFO ] Deduced a trap composed of 166 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:50:16] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-24 05:50:16] [INFO ] Deduced a trap composed of 160 places in 227 ms of which 0 ms to minimize.
[2023-03-24 05:50:17] [INFO ] Deduced a trap composed of 158 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:50:17] [INFO ] Deduced a trap composed of 158 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:50:17] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:50:18] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-24 05:50:18] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2023-03-24 05:50:18] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:50:18] [INFO ] Deduced a trap composed of 154 places in 225 ms of which 0 ms to minimize.
[2023-03-24 05:50:19] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:50:19] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:50:19] [INFO ] Deduced a trap composed of 174 places in 228 ms of which 0 ms to minimize.
[2023-03-24 05:50:19] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2023-03-24 05:50:20] [INFO ] Deduced a trap composed of 160 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:50:20] [INFO ] Deduced a trap composed of 156 places in 232 ms of which 1 ms to minimize.
[2023-03-24 05:50:20] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-24 05:50:20] [INFO ] Deduced a trap composed of 162 places in 228 ms of which 1 ms to minimize.
[2023-03-24 05:50:21] [INFO ] Deduced a trap composed of 162 places in 230 ms of which 1 ms to minimize.
[2023-03-24 05:50:21] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 1 ms to minimize.
[2023-03-24 05:50:21] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 0 ms to minimize.
[2023-03-24 05:50:22] [INFO ] Deduced a trap composed of 158 places in 223 ms of which 1 ms to minimize.
[2023-03-24 05:50:22] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2023-03-24 05:50:31] [INFO ] Trap strengthening (SAT) tested/added 256/256 trap constraints in 99486 ms
[2023-03-24 05:50:31] [INFO ] After 100235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 05:50:31] [INFO ] After 100333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 31 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J20-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 05:50:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 05:50:31] [INFO ] Flatten gal took : 110 ms
[2023-03-24 05:50:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J20-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 05:50:32] [INFO ] Flatten gal took : 114 ms
[2023-03-24 05:50:32] [INFO ] Input system was already deterministic with 1035 transitions.
Support contains 234 out of 474 places (down from 468) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 1031
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 25 rules applied. Total rules applied 29 place count 460 transition count 1010
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 50 place count 439 transition count 1009
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 438 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 53 place count 437 transition count 1008
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 437 transition count 1008
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 435 transition count 1006
Applied a total of 58 rules in 84 ms. Remains 435 /474 variables (removed 39) and now considering 1006/1035 (removed 29) transitions.
[2023-03-24 05:50:33] [INFO ] Flow matrix only has 997 transitions (discarded 9 similar events)
// Phase 1: matrix 997 rows 435 cols
[2023-03-24 05:50:33] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-24 05:50:33] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 727 ms. Remains : 435/474 places, 1006/1035 transitions.
[2023-03-24 05:50:33] [INFO ] Flatten gal took : 62 ms
[2023-03-24 05:50:33] [INFO ] Flatten gal took : 63 ms
[2023-03-24 05:50:33] [INFO ] Input system was already deterministic with 1006 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 19 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:33] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 05:50:33] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-24 05:50:34] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:34] [INFO ] Flatten gal took : 51 ms
[2023-03-24 05:50:34] [INFO ] Flatten gal took : 54 ms
[2023-03-24 05:50:34] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Applied a total of 10 rules in 11 ms. Remains 464 /474 variables (removed 10) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 05:50:34] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 464 cols
[2023-03-24 05:50:34] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 05:50:35] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 743 ms. Remains : 464/474 places, 1035/1035 transitions.
[2023-03-24 05:50:35] [INFO ] Flatten gal took : 46 ms
[2023-03-24 05:50:35] [INFO ] Flatten gal took : 50 ms
[2023-03-24 05:50:35] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 22 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:35] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 05:50:35] [INFO ] Computed 62 place invariants in 19 ms
[2023-03-24 05:50:36] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:36] [INFO ] Flatten gal took : 48 ms
[2023-03-24 05:50:36] [INFO ] Flatten gal took : 58 ms
[2023-03-24 05:50:36] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 16 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:36] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 05:50:36] [INFO ] Invariant cache hit.
[2023-03-24 05:50:37] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 784 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:37] [INFO ] Flatten gal took : 42 ms
[2023-03-24 05:50:37] [INFO ] Flatten gal took : 46 ms
[2023-03-24 05:50:37] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 17 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:37] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
[2023-03-24 05:50:37] [INFO ] Invariant cache hit.
[2023-03-24 05:50:38] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:38] [INFO ] Flatten gal took : 41 ms
[2023-03-24 05:50:38] [INFO ] Flatten gal took : 45 ms
[2023-03-24 05:50:38] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Applied a total of 0 rules in 6 ms. Remains 474 /474 variables (removed 0) and now considering 1035/1035 (removed 0) transitions.
[2023-03-24 05:50:38] [INFO ] Flow matrix only has 1026 transitions (discarded 9 similar events)
// Phase 1: matrix 1026 rows 474 cols
[2023-03-24 05:50:38] [INFO ] Computed 72 place invariants in 14 ms
[2023-03-24 05:50:39] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 474/474 places, 1035/1035 transitions.
[2023-03-24 05:50:39] [INFO ] Flatten gal took : 59 ms
[2023-03-24 05:50:39] [INFO ] Flatten gal took : 75 ms
[2023-03-24 05:50:39] [INFO ] Input system was already deterministic with 1035 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 16 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:39] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 05:50:39] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-24 05:50:40] [INFO ] Dead Transitions using invariants and state equation in 779 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:40] [INFO ] Flatten gal took : 44 ms
[2023-03-24 05:50:40] [INFO ] Flatten gal took : 47 ms
[2023-03-24 05:50:40] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 64 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2023-03-24 05:50:40] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 05:50:40] [INFO ] Computed 62 place invariants in 15 ms
[2023-03-24 05:50:41] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 649 ms. Remains : 412/474 places, 983/1035 transitions.
[2023-03-24 05:50:41] [INFO ] Flatten gal took : 46 ms
[2023-03-24 05:50:41] [INFO ] Flatten gal took : 48 ms
[2023-03-24 05:50:41] [INFO ] Input system was already deterministic with 983 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 16 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:41] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 05:50:41] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-24 05:50:42] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 799 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:42] [INFO ] Flatten gal took : 42 ms
[2023-03-24 05:50:42] [INFO ] Flatten gal took : 45 ms
[2023-03-24 05:50:42] [INFO ] Input system was already deterministic with 1034 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 464 transition count 1010
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 439 transition count 1010
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 439 transition count 986
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 415 transition count 986
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 414 transition count 985
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 414 transition count 985
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 412 transition count 983
Applied a total of 104 rules in 68 ms. Remains 412 /474 variables (removed 62) and now considering 983/1035 (removed 52) transitions.
[2023-03-24 05:50:42] [INFO ] Flow matrix only has 974 transitions (discarded 9 similar events)
// Phase 1: matrix 974 rows 412 cols
[2023-03-24 05:50:42] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-24 05:50:43] [INFO ] Dead Transitions using invariants and state equation in 557 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 627 ms. Remains : 412/474 places, 983/1035 transitions.
[2023-03-24 05:50:43] [INFO ] Flatten gal took : 46 ms
[2023-03-24 05:50:43] [INFO ] Flatten gal took : 48 ms
[2023-03-24 05:50:43] [INFO ] Input system was already deterministic with 983 transitions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1035/1035 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1034
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1034
Applied a total of 12 rules in 15 ms. Remains 463 /474 variables (removed 11) and now considering 1034/1035 (removed 1) transitions.
[2023-03-24 05:50:43] [INFO ] Flow matrix only has 1025 transitions (discarded 9 similar events)
// Phase 1: matrix 1025 rows 463 cols
[2023-03-24 05:50:43] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-24 05:50:44] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 797 ms. Remains : 463/474 places, 1034/1035 transitions.
[2023-03-24 05:50:44] [INFO ] Flatten gal took : 41 ms
[2023-03-24 05:50:44] [INFO ] Flatten gal took : 44 ms
[2023-03-24 05:50:44] [INFO ] Input system was already deterministic with 1034 transitions.
[2023-03-24 05:50:44] [INFO ] Flatten gal took : 94 ms
[2023-03-24 05:50:44] [INFO ] Flatten gal took : 92 ms
[2023-03-24 05:50:45] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 32 ms.
[2023-03-24 05:50:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 474 places, 1035 transitions and 6944 arcs took 7 ms.
Total runtime 212891 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1901/ctl_0_ --ctl=/tmp/1901/ctl_1_ --ctl=/tmp/1901/ctl_2_ --ctl=/tmp/1901/ctl_3_ --ctl=/tmp/1901/ctl_4_ --ctl=/tmp/1901/ctl_5_ --ctl=/tmp/1901/ctl_6_ --ctl=/tmp/1901/ctl_7_ --ctl=/tmp/1901/ctl_8_ --ctl=/tmp/1901/ctl_9_ --ctl=/tmp/1901/ctl_10_ --ctl=/tmp/1901/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14049116 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16071624 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;