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.r105-tall-167814481600724.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 DLCround-PT-09b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481600724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-09b-LTLFireability-00
FORMULA_NAME DLCround-PT-09b-LTLFireability-01
FORMULA_NAME DLCround-PT-09b-LTLFireability-02
FORMULA_NAME DLCround-PT-09b-LTLFireability-03
FORMULA_NAME DLCround-PT-09b-LTLFireability-04
FORMULA_NAME DLCround-PT-09b-LTLFireability-05
FORMULA_NAME DLCround-PT-09b-LTLFireability-06
FORMULA_NAME DLCround-PT-09b-LTLFireability-07
FORMULA_NAME DLCround-PT-09b-LTLFireability-08
FORMULA_NAME DLCround-PT-09b-LTLFireability-09
FORMULA_NAME DLCround-PT-09b-LTLFireability-10
FORMULA_NAME DLCround-PT-09b-LTLFireability-11
FORMULA_NAME DLCround-PT-09b-LTLFireability-12
FORMULA_NAME DLCround-PT-09b-LTLFireability-13
FORMULA_NAME DLCround-PT-09b-LTLFireability-14
FORMULA_NAME DLCround-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678367492460

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-09b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 13:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 13:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 13:11:34] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-09 13:11:34] [INFO ] Transformed 3495 places.
[2023-03-09 13:11:34] [INFO ] Transformed 5439 transitions.
[2023-03-09 13:11:34] [INFO ] Found NUPN structural information;
[2023-03-09 13:11:34] [INFO ] Parsed PT model containing 3495 places and 5439 transitions and 15081 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-09b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 3495 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3495/3495 places, 5439/5439 transitions.
Discarding 618 places :
Symmetric choice reduction at 0 with 618 rule applications. Total rules 618 place count 2877 transition count 4821
Iterating global reduction 0 with 618 rules applied. Total rules applied 1236 place count 2877 transition count 4821
Discarding 499 places :
Symmetric choice reduction at 0 with 499 rule applications. Total rules 1735 place count 2378 transition count 4322
Iterating global reduction 0 with 499 rules applied. Total rules applied 2234 place count 2378 transition count 4322
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 2243 place count 2378 transition count 4313
Discarding 63 places :
Symmetric choice reduction at 1 with 63 rule applications. Total rules 2306 place count 2315 transition count 4174
Iterating global reduction 1 with 63 rules applied. Total rules applied 2369 place count 2315 transition count 4174
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 2406 place count 2278 transition count 4137
Iterating global reduction 1 with 37 rules applied. Total rules applied 2443 place count 2278 transition count 4137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 2447 place count 2278 transition count 4133
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2468 place count 2257 transition count 4112
Iterating global reduction 2 with 21 rules applied. Total rules applied 2489 place count 2257 transition count 4112
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2510 place count 2236 transition count 4091
Iterating global reduction 2 with 21 rules applied. Total rules applied 2531 place count 2236 transition count 4091
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2552 place count 2215 transition count 4070
Iterating global reduction 2 with 21 rules applied. Total rules applied 2573 place count 2215 transition count 4070
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 2585 place count 2203 transition count 4058
Iterating global reduction 2 with 12 rules applied. Total rules applied 2597 place count 2203 transition count 4058
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2605 place count 2195 transition count 4050
Iterating global reduction 2 with 8 rules applied. Total rules applied 2613 place count 2195 transition count 4050
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 2621 place count 2187 transition count 4042
Iterating global reduction 2 with 8 rules applied. Total rules applied 2629 place count 2187 transition count 4042
Applied a total of 2629 rules in 1818 ms. Remains 2187 /3495 variables (removed 1308) and now considering 4042/5439 (removed 1397) transitions.
// Phase 1: matrix 4042 rows 2187 cols
[2023-03-09 13:11:36] [INFO ] Computed 184 place invariants in 45 ms
[2023-03-09 13:11:38] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2023-03-09 13:11:38] [INFO ] Invariant cache hit.
[2023-03-09 13:11:40] [INFO ] Implicit Places using invariants and state equation in 2300 ms returned []
Implicit Place search using SMT with State Equation took 3772 ms to find 0 implicit places.
[2023-03-09 13:11:40] [INFO ] Invariant cache hit.
[2023-03-09 13:11:42] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2187/3495 places, 4042/5439 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7733 ms. Remains : 2187/3495 places, 4042/5439 transitions.
Support contains 54 out of 2187 places after structural reductions.
[2023-03-09 13:11:43] [INFO ] Flatten gal took : 430 ms
[2023-03-09 13:11:43] [INFO ] Flatten gal took : 303 ms
[2023-03-09 13:11:44] [INFO ] Input system was already deterministic with 4042 transitions.
Support contains 53 out of 2187 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 35) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-09 13:11:45] [INFO ] Invariant cache hit.
[2023-03-09 13:11:46] [INFO ] [Real]Absence check using 184 positive place invariants in 204 ms returned sat
[2023-03-09 13:11:46] [INFO ] After 1446ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:17
[2023-03-09 13:11:47] [INFO ] [Nat]Absence check using 184 positive place invariants in 187 ms returned sat
[2023-03-09 13:11:51] [INFO ] After 3064ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :17
[2023-03-09 13:11:54] [INFO ] After 6470ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :17
Attempting to minimize the solution found.
Minimization took 1688 ms.
[2023-03-09 13:11:56] [INFO ] After 9902ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :17
Fused 18 Parikh solutions to 13 different solutions.
Parikh walk visited 14 properties in 644 ms.
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 9 ms
Free SCC test removed 493 places
Drop transitions removed 561 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 575 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1694 transition count 3136
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1363 transition count 3093
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1335 transition count 3093
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1335 transition count 2911
Deduced a syphon composed of 182 places in 11 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1153 transition count 2911
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1170 place count 1081 transition count 2299
Iterating global reduction 3 with 72 rules applied. Total rules applied 1242 place count 1081 transition count 2299
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1246 place count 1081 transition count 2295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1246 place count 1081 transition count 2293
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1250 place count 1079 transition count 2293
Performed 414 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 414 places in 1 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 4 with 828 rules applied. Total rules applied 2078 place count 665 transition count 1869
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 665 transition count 1859
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2112 place count 641 transition count 1559
Iterating global reduction 5 with 24 rules applied. Total rules applied 2136 place count 641 transition count 1559
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2160 place count 641 transition count 1535
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -418
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 2240 place count 601 transition count 1953
Drop transitions removed 13 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 2257 place count 601 transition count 1936
Discarding 21 places :
Symmetric choice reduction at 7 with 21 rule applications. Total rules 2278 place count 580 transition count 1409
Iterating global reduction 7 with 21 rules applied. Total rules applied 2299 place count 580 transition count 1409
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 2320 place count 580 transition count 1388
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2328 place count 576 transition count 1421
Drop transitions removed 150 transitions
Redundant transition composition rules discarded 150 transitions
Iterating global reduction 8 with 150 rules applied. Total rules applied 2478 place count 576 transition count 1271
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 2488 place count 566 transition count 1140
Iterating global reduction 8 with 10 rules applied. Total rules applied 2498 place count 566 transition count 1140
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 2508 place count 566 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2516 place count 562 transition count 1157
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 2521 place count 562 transition count 1152
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 10 with 22 rules applied. Total rules applied 2543 place count 562 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2551 place count 558 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2557 place count 558 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 11 with 21 rules applied. Total rules applied 2578 place count 558 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 2586 place count 554 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2592 place count 554 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 2613 place count 554 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 2621 place count 550 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 2627 place count 550 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 2648 place count 550 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 2656 place count 546 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 2662 place count 546 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 2683 place count 546 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 2691 place count 542 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 2697 place count 542 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 2718 place count 542 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 2726 place count 538 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 2732 place count 538 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 2753 place count 538 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 2761 place count 534 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 2767 place count 534 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 2788 place count 534 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 2796 place count 530 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2802 place count 530 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 2823 place count 530 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 2831 place count 526 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 2837 place count 526 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 2858 place count 526 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 2866 place count 522 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 2872 place count 522 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 2893 place count 522 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 2901 place count 518 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 2907 place count 518 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 2928 place count 518 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 2936 place count 514 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 2942 place count 514 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 2963 place count 514 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 2971 place count 510 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 2977 place count 510 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 2998 place count 510 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 3006 place count 506 transition count 1157
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 3012 place count 506 transition count 1151
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 3033 place count 506 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 3041 place count 502 transition count 1161
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 3047 place count 502 transition count 1155
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 3068 place count 502 transition count 1134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 25 with 8 rules applied. Total rules applied 3076 place count 498 transition count 1165
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 25 with 6 rules applied. Total rules applied 3082 place count 498 transition count 1159
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 26 with 21 rules applied. Total rules applied 3103 place count 498 transition count 1138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 26 with 8 rules applied. Total rules applied 3111 place count 494 transition count 1169
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 26 with 8 rules applied. Total rules applied 3119 place count 494 transition count 1161
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 27 with 20 rules applied. Total rules applied 3139 place count 494 transition count 1141
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 27 with 8 rules applied. Total rules applied 3147 place count 490 transition count 1174
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 27 with 7 rules applied. Total rules applied 3154 place count 490 transition count 1167
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 28 with 21 rules applied. Total rules applied 3175 place count 490 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 28 with 8 rules applied. Total rules applied 3183 place count 486 transition count 1171
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 28 with 5 rules applied. Total rules applied 3188 place count 486 transition count 1166
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 29 with 20 rules applied. Total rules applied 3208 place count 486 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 29 with 8 rules applied. Total rules applied 3216 place count 482 transition count 1165
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 3220 place count 482 transition count 1161
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 30 with 19 rules applied. Total rules applied 3239 place count 482 transition count 1142
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 30 with 8 rules applied. Total rules applied 3247 place count 478 transition count 1161
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 3251 place count 478 transition count 1157
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 31 with 19 rules applied. Total rules applied 3270 place count 478 transition count 1138
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 31 with 8 rules applied. Total rules applied 3278 place count 474 transition count 1157
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 3282 place count 474 transition count 1153
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 32 with 19 rules applied. Total rules applied 3301 place count 474 transition count 1134
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 32 with 8 rules applied. Total rules applied 3309 place count 470 transition count 1153
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 3313 place count 470 transition count 1149
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 33 with 19 rules applied. Total rules applied 3332 place count 470 transition count 1130
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 33 with 8 rules applied. Total rules applied 3340 place count 466 transition count 1149
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 3344 place count 466 transition count 1145
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 34 with 19 rules applied. Total rules applied 3363 place count 466 transition count 1126
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 34 with 8 rules applied. Total rules applied 3371 place count 462 transition count 1145
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 3375 place count 462 transition count 1141
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 35 with 19 rules applied. Total rules applied 3394 place count 462 transition count 1122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 35 with 8 rules applied. Total rules applied 3402 place count 458 transition count 1141
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 3406 place count 458 transition count 1137
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 36 with 19 rules applied. Total rules applied 3425 place count 458 transition count 1118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 36 with 8 rules applied. Total rules applied 3433 place count 454 transition count 1137
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 36 with 4 rules applied. Total rules applied 3437 place count 454 transition count 1133
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 37 with 19 rules applied. Total rules applied 3456 place count 454 transition count 1114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 37 with 8 rules applied. Total rules applied 3464 place count 450 transition count 1133
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 37 with 4 rules applied. Total rules applied 3468 place count 450 transition count 1129
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 38 with 19 rules applied. Total rules applied 3487 place count 450 transition count 1110
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 38 with 8 rules applied. Total rules applied 3495 place count 446 transition count 1129
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 38 with 4 rules applied. Total rules applied 3499 place count 446 transition count 1125
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 39 with 19 rules applied. Total rules applied 3518 place count 446 transition count 1106
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 39 with 8 rules applied. Total rules applied 3526 place count 442 transition count 1125
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 4 rules applied. Total rules applied 3530 place count 442 transition count 1121
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 40 with 19 rules applied. Total rules applied 3549 place count 442 transition count 1102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 40 with 8 rules applied. Total rules applied 3557 place count 438 transition count 1121
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 40 with 4 rules applied. Total rules applied 3561 place count 438 transition count 1117
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 41 with 19 rules applied. Total rules applied 3580 place count 438 transition count 1098
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 41 with 8 rules applied. Total rules applied 3588 place count 434 transition count 1117
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 41 with 4 rules applied. Total rules applied 3592 place count 434 transition count 1113
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 42 with 19 rules applied. Total rules applied 3611 place count 434 transition count 1094
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 42 with 8 rules applied. Total rules applied 3619 place count 430 transition count 1113
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 42 with 4 rules applied. Total rules applied 3623 place count 430 transition count 1109
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 43 with 19 rules applied. Total rules applied 3642 place count 430 transition count 1090
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 43 with 8 rules applied. Total rules applied 3650 place count 426 transition count 1109
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 43 with 4 rules applied. Total rules applied 3654 place count 426 transition count 1105
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 44 with 19 rules applied. Total rules applied 3673 place count 426 transition count 1086
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 44 with 8 rules applied. Total rules applied 3681 place count 422 transition count 1105
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 44 with 4 rules applied. Total rules applied 3685 place count 422 transition count 1101
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 45 with 19 rules applied. Total rules applied 3704 place count 422 transition count 1082
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 45 with 8 rules applied. Total rules applied 3712 place count 418 transition count 1101
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 4 rules applied. Total rules applied 3716 place count 418 transition count 1097
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 46 with 19 rules applied. Total rules applied 3735 place count 418 transition count 1078
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 46 with 8 rules applied. Total rules applied 3743 place count 414 transition count 1105
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 46 with 4 rules applied. Total rules applied 3747 place count 414 transition count 1101
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 47 with 19 rules applied. Total rules applied 3766 place count 414 transition count 1082
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 47 with 8 rules applied. Total rules applied 3774 place count 410 transition count 1109
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 47 with 4 rules applied. Total rules applied 3778 place count 410 transition count 1105
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 48 with 19 rules applied. Total rules applied 3797 place count 410 transition count 1086
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 48 with 8 rules applied. Total rules applied 3805 place count 406 transition count 1121
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 48 with 8 rules applied. Total rules applied 3813 place count 406 transition count 1113
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 49 with 19 rules applied. Total rules applied 3832 place count 406 transition count 1094
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 49 with 8 rules applied. Total rules applied 3840 place count 402 transition count 1129
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 49 with 8 rules applied. Total rules applied 3848 place count 402 transition count 1121
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 50 with 19 rules applied. Total rules applied 3867 place count 402 transition count 1102
Free-agglomeration rule applied 36 times with reduction of 2 identical transitions.
Iterating global reduction 50 with 36 rules applied. Total rules applied 3903 place count 402 transition count 1064
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 378 transitions
Reduce isomorphic transitions removed 378 transitions.
Graph (complete) has 1080 edges and 366 vertex of which 222 are kept as prefixes of interest. Removing 144 places using SCC suffix rule.0 ms
Discarding 144 places :
Also discarding 0 output transitions
Iterating post reduction 50 with 415 rules applied. Total rules applied 4318 place count 222 transition count 686
Drop transitions removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 51 with 144 rules applied. Total rules applied 4462 place count 222 transition count 542
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 52 with 66 rules applied. Total rules applied 4528 place count 222 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 52 with 1 rules applied. Total rules applied 4529 place count 221 transition count 475
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 52 with 8 rules applied. Total rules applied 4537 place count 213 transition count 475
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 53 with 96 rules applied. Total rules applied 4633 place count 149 transition count 443
Drop transitions removed 32 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 53 with 92 rules applied. Total rules applied 4725 place count 149 transition count 351
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 54 with 138 rules applied. Total rules applied 4863 place count 57 transition count 305
Drop transitions removed 71 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 164 transitions.
Graph (trivial) has 14 edges and 57 vertex of which 12 / 57 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 54 with 165 rules applied. Total rules applied 5028 place count 51 transition count 141
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 38 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 106 edges and 47 vertex of which 31 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Iterating post reduction 55 with 59 rules applied. Total rules applied 5087 place count 31 transition count 79
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 56 with 8 rules applied. Total rules applied 5095 place count 31 transition count 71
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 57 with 24 rules applied. Total rules applied 5119 place count 15 transition count 63
Drop transitions removed 12 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 57 with 36 rules applied. Total rules applied 5155 place count 15 transition count 27
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 58 with 5 rules applied. Total rules applied 5160 place count 15 transition count 22
Free-agglomeration rule applied 1 times.
Iterating global reduction 58 with 1 rules applied. Total rules applied 5161 place count 15 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 58 with 1 rules applied. Total rules applied 5162 place count 14 transition count 21
Applied a total of 5162 rules in 3750 ms. Remains 14 /2187 variables (removed 2173) and now considering 21/4042 (removed 4021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3750 ms. Remains : 14/2187 places, 21/4042 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
FORMULA DLCround-PT-09b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 363 stabilizing places and 363 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0))&&G(!p1)) U p2))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 2179 transition count 3986
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 2179 transition count 3986
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 2177 transition count 3984
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 2177 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2176 transition count 3983
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2176 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2175 transition count 3982
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2175 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2174 transition count 3981
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2174 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2173 transition count 3980
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2173 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2172 transition count 3979
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2172 transition count 3979
Applied a total of 30 rules in 712 ms. Remains 2172 /2187 variables (removed 15) and now considering 3979/4042 (removed 63) transitions.
// Phase 1: matrix 3979 rows 2172 cols
[2023-03-09 13:12:02] [INFO ] Computed 184 place invariants in 31 ms
[2023-03-09 13:12:04] [INFO ] Implicit Places using invariants in 1274 ms returned []
[2023-03-09 13:12:04] [INFO ] Invariant cache hit.
[2023-03-09 13:12:06] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 3337 ms to find 0 implicit places.
[2023-03-09 13:12:06] [INFO ] Invariant cache hit.
[2023-03-09 13:12:07] [INFO ] Dead Transitions using invariants and state equation in 1870 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2172/2187 places, 3979/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5921 ms. Remains : 2172/2187 places, 3979/4042 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) p1), true, (NOT p2), (OR (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s472 1) (EQ s1828 1)), p0:(NEQ s216 1), p2:(EQ s1601 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5382 steps with 0 reset in 59 ms.
FORMULA DLCround-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-00 finished in 6460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1&&X(p1))))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 724 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-09 13:12:09] [INFO ] Computed 184 place invariants in 20 ms
[2023-03-09 13:12:09] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-09 13:12:09] [INFO ] Invariant cache hit.
[2023-03-09 13:12:11] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2882 ms to find 0 implicit places.
[2023-03-09 13:12:11] [INFO ] Invariant cache hit.
[2023-03-09 13:12:13] [INFO ] Dead Transitions using invariants and state equation in 1805 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5428 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s850 0) (EQ s1569 0)), p0:(EQ s730 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2472 steps with 0 reset in 20 ms.
FORMULA DLCround-PT-09b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-01 finished in 5641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(F(p1)))))'
Support contains 2 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 2180 transition count 3987
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 2180 transition count 3987
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 2180 transition count 3986
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 2178 transition count 3984
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 2177 transition count 3983
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 2177 transition count 3983
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 2176 transition count 3982
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Applied a total of 29 rules in 776 ms. Remains 2173 /2187 variables (removed 14) and now considering 3979/4042 (removed 63) transitions.
// Phase 1: matrix 3979 rows 2173 cols
[2023-03-09 13:12:14] [INFO ] Computed 184 place invariants in 32 ms
[2023-03-09 13:12:15] [INFO ] Implicit Places using invariants in 704 ms returned []
[2023-03-09 13:12:15] [INFO ] Invariant cache hit.
[2023-03-09 13:12:17] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2827 ms to find 0 implicit places.
[2023-03-09 13:12:17] [INFO ] Invariant cache hit.
[2023-03-09 13:12:19] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2173/2187 places, 3979/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5502 ms. Remains : 2173/2187 places, 3979/4042 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1165 0), p1:(EQ s2024 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1779 ms.
Product exploration explored 100000 steps with 50000 reset in 1725 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-09b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-09b-LTLFireability-03 finished in 9390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1||G(p2)) U G(!p0))))'
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 522 / 2187 are part of one of the 43 SCC in 1 ms
Free SCC test removed 479 places
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 336 transitions
Trivial Post-agglo rules discarded 336 transitions
Performed 336 trivial Post agglomeration. Transition count delta: 336
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1707 transition count 3190
Reduce places removed 336 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 379 rules applied. Total rules applied 716 place count 1371 transition count 3147
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 29 rules applied. Total rules applied 745 place count 1343 transition count 3146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 746 place count 1342 transition count 3146
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 185 Pre rules applied. Total rules applied 746 place count 1342 transition count 2961
Deduced a syphon composed of 185 places in 12 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 4 with 370 rules applied. Total rules applied 1116 place count 1157 transition count 2961
Discarding 71 places :
Symmetric choice reduction at 4 with 71 rule applications. Total rules 1187 place count 1086 transition count 2347
Iterating global reduction 4 with 71 rules applied. Total rules applied 1258 place count 1086 transition count 2347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1261 place count 1086 transition count 2344
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1261 place count 1086 transition count 2342
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1265 place count 1084 transition count 2342
Performed 416 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 416 places in 1 ms
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 5 with 832 rules applied. Total rules applied 2097 place count 668 transition count 1916
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 2108 place count 668 transition count 1905
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 2131 place count 645 transition count 1618
Iterating global reduction 6 with 23 rules applied. Total rules applied 2154 place count 645 transition count 1618
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 2177 place count 645 transition count 1595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2179 place count 644 transition count 1594
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 2205 place count 631 transition count 1714
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2210 place count 631 transition count 1709
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2215 place count 626 transition count 1603
Iterating global reduction 8 with 5 rules applied. Total rules applied 2220 place count 626 transition count 1603
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2224 place count 626 transition count 1599
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 2232 place count 622 transition count 1633
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 9 with 40 rules applied. Total rules applied 2272 place count 622 transition count 1593
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2291 place count 603 transition count 1555
Iterating global reduction 9 with 19 rules applied. Total rules applied 2310 place count 603 transition count 1555
Discarding 19 places :
Symmetric choice reduction at 9 with 19 rule applications. Total rules 2329 place count 584 transition count 1304
Iterating global reduction 9 with 19 rules applied. Total rules applied 2348 place count 584 transition count 1304
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 2367 place count 584 transition count 1285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2368 place count 583 transition count 1284
Applied a total of 2368 rules in 753 ms. Remains 583 /2187 variables (removed 1604) and now considering 1284/4042 (removed 2758) transitions.
[2023-03-09 13:12:24] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
// Phase 1: matrix 1254 rows 583 cols
[2023-03-09 13:12:24] [INFO ] Computed 184 place invariants in 3 ms
[2023-03-09 13:12:24] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-09 13:12:24] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
[2023-03-09 13:12:24] [INFO ] Invariant cache hit.
[2023-03-09 13:12:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 13:12:25] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2023-03-09 13:12:25] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-09 13:12:25] [INFO ] Flow matrix only has 1254 transitions (discarded 30 similar events)
[2023-03-09 13:12:25] [INFO ] Invariant cache hit.
[2023-03-09 13:12:25] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/2187 places, 1284/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2389 ms. Remains : 583/2187 places, 1284/4042 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, true, p0, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND p0 (NOT p2) p1), p0]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 5}, { cond=(OR p1 p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s368 1)), p1:(AND (EQ s67 1) (EQ s531 1)), p2:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-04 finished in 2680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p0&&F(p1)))))'
Support contains 2 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1924 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 372 rules applied. Total rules applied 705 place count 1361 transition count 3138
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 732 place count 1335 transition count 3137
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 735 place count 1334 transition count 3135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 12 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 5 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 74 places :
Symmetric choice reduction at 5 with 74 rule applications. Total rules 1174 place count 1077 transition count 2315
Iterating global reduction 5 with 74 rules applied. Total rules applied 1248 place count 1077 transition count 2315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1252 place count 1077 transition count 2311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1252 place count 1077 transition count 2309
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1256 place count 1075 transition count 2309
Performed 409 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 409 places in 0 ms
Reduce places removed 409 places and 0 transitions.
Iterating global reduction 6 with 818 rules applied. Total rules applied 2074 place count 666 transition count 1890
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2083 place count 666 transition count 1881
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 2107 place count 642 transition count 1581
Iterating global reduction 7 with 24 rules applied. Total rules applied 2131 place count 642 transition count 1581
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 2155 place count 642 transition count 1557
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 2189 place count 625 transition count 1705
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 2193 place count 625 transition count 1701
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2197 place count 621 transition count 1613
Iterating global reduction 9 with 4 rules applied. Total rules applied 2201 place count 621 transition count 1613
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 2205 place count 621 transition count 1609
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 2213 place count 617 transition count 1646
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 10 with 51 rules applied. Total rules applied 2264 place count 617 transition count 1595
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2282 place count 599 transition count 1559
Iterating global reduction 10 with 18 rules applied. Total rules applied 2300 place count 599 transition count 1559
Discarding 18 places :
Symmetric choice reduction at 10 with 18 rule applications. Total rules 2318 place count 581 transition count 1315
Iterating global reduction 10 with 18 rules applied. Total rules applied 2336 place count 581 transition count 1315
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 2354 place count 581 transition count 1297
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2355 place count 581 transition count 1297
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2356 place count 581 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2357 place count 580 transition count 1294
Iterating global reduction 11 with 1 rules applied. Total rules applied 2358 place count 580 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 2359 place count 579 transition count 1281
Iterating global reduction 11 with 1 rules applied. Total rules applied 2360 place count 579 transition count 1281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2361 place count 579 transition count 1280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2362 place count 578 transition count 1279
Applied a total of 2362 rules in 513 ms. Remains 578 /2187 variables (removed 1609) and now considering 1279/4042 (removed 2763) transitions.
[2023-03-09 13:12:26] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
// Phase 1: matrix 1235 rows 578 cols
[2023-03-09 13:12:26] [INFO ] Computed 184 place invariants in 10 ms
[2023-03-09 13:12:26] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-09 13:12:26] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
[2023-03-09 13:12:26] [INFO ] Invariant cache hit.
[2023-03-09 13:12:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-09 13:12:27] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
[2023-03-09 13:12:27] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 13:12:27] [INFO ] Flow matrix only has 1235 transitions (discarded 44 similar events)
[2023-03-09 13:12:27] [INFO ] Invariant cache hit.
[2023-03-09 13:12:27] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 578/2187 places, 1279/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1911 ms. Remains : 578/2187 places, 1279/4042 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s76 1), p1:(NEQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-09b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-05 finished in 2032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U p1))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1922 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 14 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1173 place count 1078 transition count 2328
Iterating global reduction 3 with 73 rules applied. Total rules applied 1246 place count 1078 transition count 2328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2322
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2322
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 1 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1900
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1890
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2112 place count 640 transition count 1590
Iterating global reduction 5 with 24 rules applied. Total rules applied 2136 place count 640 transition count 1590
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2160 place count 640 transition count 1566
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2184 place count 628 transition count 1673
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2188 place count 628 transition count 1669
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2192 place count 624 transition count 1585
Iterating global reduction 7 with 4 rules applied. Total rules applied 2196 place count 624 transition count 1585
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2200 place count 624 transition count 1581
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2208 place count 620 transition count 1615
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2247 place count 620 transition count 1576
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2266 place count 601 transition count 1538
Iterating global reduction 8 with 19 rules applied. Total rules applied 2285 place count 601 transition count 1538
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2304 place count 582 transition count 1287
Iterating global reduction 8 with 19 rules applied. Total rules applied 2323 place count 582 transition count 1287
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2342 place count 582 transition count 1268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2343 place count 581 transition count 1267
Applied a total of 2343 rules in 414 ms. Remains 581 /2187 variables (removed 1606) and now considering 1267/4042 (removed 2775) transitions.
[2023-03-09 13:12:28] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
// Phase 1: matrix 1238 rows 581 cols
[2023-03-09 13:12:28] [INFO ] Computed 184 place invariants in 4 ms
[2023-03-09 13:12:28] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-09 13:12:28] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
[2023-03-09 13:12:28] [INFO ] Invariant cache hit.
[2023-03-09 13:12:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 13:12:29] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-09 13:12:29] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-09 13:12:29] [INFO ] Flow matrix only has 1238 transitions (discarded 29 similar events)
[2023-03-09 13:12:29] [INFO ] Invariant cache hit.
[2023-03-09 13:12:29] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1267/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1819 ms. Remains : 581/2187 places, 1267/4042 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s154 1), p0:(AND (EQ s32 1) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 264 steps with 0 reset in 17 ms.
FORMULA DLCround-PT-09b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-06 finished in 1979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1923 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 2 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1693 transition count 3179
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1362 transition count 3136
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1334 transition count 3136
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1334 transition count 2954
Deduced a syphon composed of 182 places in 15 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1152 transition count 2954
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1172 place count 1078 transition count 2316
Iterating global reduction 3 with 74 rules applied. Total rules applied 1246 place count 1078 transition count 2316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2310
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2310
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1888
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1878
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2111 place count 641 transition count 1591
Iterating global reduction 5 with 23 rules applied. Total rules applied 2134 place count 641 transition count 1591
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2157 place count 641 transition count 1568
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2181 place count 629 transition count 1675
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2185 place count 629 transition count 1671
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2189 place count 625 transition count 1587
Iterating global reduction 7 with 4 rules applied. Total rules applied 2193 place count 625 transition count 1587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2197 place count 625 transition count 1583
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2205 place count 621 transition count 1617
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2244 place count 621 transition count 1578
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2263 place count 602 transition count 1540
Iterating global reduction 8 with 19 rules applied. Total rules applied 2282 place count 602 transition count 1540
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2301 place count 583 transition count 1289
Iterating global reduction 8 with 19 rules applied. Total rules applied 2320 place count 583 transition count 1289
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2339 place count 583 transition count 1270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2340 place count 582 transition count 1269
Applied a total of 2340 rules in 396 ms. Remains 582 /2187 variables (removed 1605) and now considering 1269/4042 (removed 2773) transitions.
[2023-03-09 13:12:30] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
// Phase 1: matrix 1240 rows 582 cols
[2023-03-09 13:12:30] [INFO ] Computed 184 place invariants in 6 ms
[2023-03-09 13:12:30] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-09 13:12:30] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
[2023-03-09 13:12:30] [INFO ] Invariant cache hit.
[2023-03-09 13:12:31] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 13:12:31] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
[2023-03-09 13:12:31] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-09 13:12:31] [INFO ] Flow matrix only has 1240 transitions (discarded 29 similar events)
[2023-03-09 13:12:31] [INFO ] Invariant cache hit.
[2023-03-09 13:12:31] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/2187 places, 1269/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1775 ms. Remains : 582/2187 places, 1269/4042 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s47 1), p0:(AND (EQ s26 1) (EQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-07 finished in 1915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1925 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1693 transition count 3179
Reduce places removed 331 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 374 rules applied. Total rules applied 706 place count 1362 transition count 3136
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 734 place count 1334 transition count 3136
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 734 place count 1334 transition count 2954
Deduced a syphon composed of 182 places in 13 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1098 place count 1152 transition count 2954
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1172 place count 1078 transition count 2316
Iterating global reduction 3 with 74 rules applied. Total rules applied 1246 place count 1078 transition count 2316
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2310
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2310
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 1 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1888
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1878
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2112 place count 640 transition count 1578
Iterating global reduction 5 with 24 rules applied. Total rules applied 2136 place count 640 transition count 1578
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2160 place count 640 transition count 1554
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2184 place count 628 transition count 1661
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2188 place count 628 transition count 1657
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2192 place count 624 transition count 1573
Iterating global reduction 7 with 4 rules applied. Total rules applied 2196 place count 624 transition count 1573
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2200 place count 624 transition count 1569
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2208 place count 620 transition count 1603
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2247 place count 620 transition count 1564
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2266 place count 601 transition count 1526
Iterating global reduction 8 with 19 rules applied. Total rules applied 2285 place count 601 transition count 1526
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2304 place count 582 transition count 1275
Iterating global reduction 8 with 19 rules applied. Total rules applied 2323 place count 582 transition count 1275
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2342 place count 582 transition count 1256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2343 place count 581 transition count 1255
Applied a total of 2343 rules in 389 ms. Remains 581 /2187 variables (removed 1606) and now considering 1255/4042 (removed 2787) transitions.
[2023-03-09 13:12:32] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
// Phase 1: matrix 1226 rows 581 cols
[2023-03-09 13:12:32] [INFO ] Computed 184 place invariants in 9 ms
[2023-03-09 13:12:32] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-09 13:12:32] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2023-03-09 13:12:32] [INFO ] Invariant cache hit.
[2023-03-09 13:12:33] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 13:12:33] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-09 13:12:33] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 13:12:33] [INFO ] Flow matrix only has 1226 transitions (discarded 29 similar events)
[2023-03-09 13:12:33] [INFO ] Invariant cache hit.
[2023-03-09 13:12:33] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1255/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 581/2187 places, 1255/4042 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-08 finished in 1980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(p1)) U (!p2 U p1)))'
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 13 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 1171 place count 1080 transition count 2354
Iterating global reduction 3 with 71 rules applied. Total rules applied 1242 place count 1080 transition count 2354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1246 place count 1080 transition count 2350
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1246 place count 1080 transition count 2348
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2348
Performed 410 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 410 places in 1 ms
Reduce places removed 410 places and 0 transitions.
Iterating global reduction 4 with 820 rules applied. Total rules applied 2070 place count 668 transition count 1929
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 2079 place count 668 transition count 1920
Renaming transitions due to excessive name length > 1024 char.
Discarding 24 places :
Symmetric choice reduction at 5 with 24 rule applications. Total rules 2103 place count 644 transition count 1620
Iterating global reduction 5 with 24 rules applied. Total rules applied 2127 place count 644 transition count 1620
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2151 place count 644 transition count 1596
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2175 place count 632 transition count 1703
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2179 place count 632 transition count 1699
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2183 place count 628 transition count 1615
Iterating global reduction 7 with 4 rules applied. Total rules applied 2187 place count 628 transition count 1615
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2191 place count 628 transition count 1611
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2199 place count 624 transition count 1645
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2236 place count 624 transition count 1608
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2252 place count 608 transition count 1576
Iterating global reduction 8 with 16 rules applied. Total rules applied 2268 place count 608 transition count 1576
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 2284 place count 592 transition count 1364
Iterating global reduction 8 with 16 rules applied. Total rules applied 2300 place count 592 transition count 1364
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 2316 place count 592 transition count 1348
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2319 place count 592 transition count 1348
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2321 place count 592 transition count 1346
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2323 place count 590 transition count 1342
Iterating global reduction 9 with 2 rules applied. Total rules applied 2325 place count 590 transition count 1342
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2327 place count 588 transition count 1316
Iterating global reduction 9 with 2 rules applied. Total rules applied 2329 place count 588 transition count 1316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2331 place count 588 transition count 1314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2332 place count 587 transition count 1313
Applied a total of 2332 rules in 478 ms. Remains 587 /2187 variables (removed 1600) and now considering 1313/4042 (removed 2729) transitions.
[2023-03-09 13:12:34] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
// Phase 1: matrix 1283 rows 587 cols
[2023-03-09 13:12:34] [INFO ] Computed 184 place invariants in 5 ms
[2023-03-09 13:12:34] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 13:12:34] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
[2023-03-09 13:12:34] [INFO ] Invariant cache hit.
[2023-03-09 13:12:35] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 13:12:35] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2023-03-09 13:12:35] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 13:12:35] [INFO ] Flow matrix only has 1283 transitions (discarded 30 similar events)
[2023-03-09 13:12:35] [INFO ] Invariant cache hit.
[2023-03-09 13:12:36] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/2187 places, 1313/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2087 ms. Remains : 587/2187 places, 1313/4042 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s391 1)), p2:(AND (EQ s72 1) (EQ s550 1)), p0:(AND (EQ s29 1) (EQ s358 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-09 finished in 2197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G((!p0||X(p2)))&&(!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 735 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-09 13:12:36] [INFO ] Computed 184 place invariants in 13 ms
[2023-03-09 13:12:37] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-09 13:12:37] [INFO ] Invariant cache hit.
[2023-03-09 13:12:39] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2023-03-09 13:12:39] [INFO ] Invariant cache hit.
[2023-03-09 13:12:41] [INFO ] Dead Transitions using invariants and state equation in 2010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5024 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p2), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (AND (EQ s125 1) (EQ s1323 1)) (NOT (AND (EQ s343 1) (EQ s1202 1)))), p0:(AND (EQ s125 1) (EQ s1323 1)), p1:(AND (NOT (AND (EQ s125 1) (EQ s1323 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 734 ms.
Product exploration explored 100000 steps with 0 reset in 938 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 764 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 167834 steps, run timeout after 3003 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167834 steps, saw 165770 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-09 13:12:47] [INFO ] Invariant cache hit.
[2023-03-09 13:12:48] [INFO ] [Real]Absence check using 184 positive place invariants in 144 ms returned sat
[2023-03-09 13:12:50] [INFO ] After 2420ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:10
[2023-03-09 13:12:51] [INFO ] [Nat]Absence check using 184 positive place invariants in 126 ms returned sat
[2023-03-09 13:12:53] [INFO ] After 2161ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-09 13:12:55] [INFO ] After 4080ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 1019 ms.
[2023-03-09 13:12:56] [INFO ] After 6121ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 6 different solutions.
Finished Parikh walk after 754 steps, including 0 resets, run visited all 10 properties in 16 ms. (steps per millisecond=47 )
Parikh walk visited 10 properties in 26 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F (AND p2 p0)), (F p0), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))]
Knowledge based reduction with 17 factoid took 1127 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), false]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), false]
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 83 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-09 13:12:58] [INFO ] Invariant cache hit.
[2023-03-09 13:12:58] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-09 13:12:58] [INFO ] Invariant cache hit.
[2023-03-09 13:13:00] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2023-03-09 13:13:01] [INFO ] Invariant cache hit.
[2023-03-09 13:13:02] [INFO ] Dead Transitions using invariants and state equation in 1927 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4884 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 197 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 231948 steps, run timeout after 3002 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 231948 steps, saw 229376 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 13:13:06] [INFO ] Invariant cache hit.
[2023-03-09 13:13:07] [INFO ] [Real]Absence check using 184 positive place invariants in 131 ms returned sat
[2023-03-09 13:13:08] [INFO ] After 1919ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 13:13:09] [INFO ] [Nat]Absence check using 184 positive place invariants in 133 ms returned sat
[2023-03-09 13:13:10] [INFO ] After 1495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 13:13:11] [INFO ] After 2032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 305 ms.
[2023-03-09 13:13:11] [INFO ] After 2866ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 740 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=74 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0)))), (F p0)]
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 147 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 598 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 169 ms :[true, (AND (NOT p0) (NOT p2)), false, false, false]
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1906 edges and 2171 vertex of which 516 / 2171 are part of one of the 45 SCC in 1 ms
Free SCC test removed 471 places
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 336 rules applied. Total rules applied 337 place count 1700 transition count 3471
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 365 place count 1700 transition count 3457
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 365 place count 1700 transition count 3462
Deduced a syphon composed of 360 places in 13 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 375 place count 1700 transition count 3462
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 528 place count 1547 transition count 2805
Deduced a syphon composed of 272 places in 11 ms
Iterating global reduction 2 with 153 rules applied. Total rules applied 681 place count 1547 transition count 2805
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 685 place count 1547 transition count 2801
Performed 587 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 859 places in 0 ms
Iterating global reduction 3 with 587 rules applied. Total rules applied 1272 place count 1547 transition count 2811
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1283 place count 1547 transition count 2800
Renaming transitions due to excessive name length > 1024 char.
Discarding 426 places :
Symmetric choice reduction at 4 with 426 rule applications. Total rules 1709 place count 1121 transition count 2110
Deduced a syphon composed of 456 places in 1 ms
Iterating global reduction 4 with 426 rules applied. Total rules applied 2135 place count 1121 transition count 2110
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 2157 place count 1121 transition count 2088
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2167 place count 1111 transition count 2078
Deduced a syphon composed of 446 places in 1 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2177 place count 1111 transition count 2078
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 447 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2178 place count 1111 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2179 place count 1110 transition count 2077
Deduced a syphon composed of 446 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 2180 place count 1110 transition count 2077
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -218
Deduced a syphon composed of 478 places in 1 ms
Iterating global reduction 5 with 32 rules applied. Total rules applied 2212 place count 1110 transition count 2295
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 2227 place count 1110 transition count 2280
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 2272 place count 1065 transition count 2125
Deduced a syphon composed of 436 places in 1 ms
Iterating global reduction 6 with 45 rules applied. Total rules applied 2317 place count 1065 transition count 2125
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2323 place count 1065 transition count 2119
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2329 place count 1059 transition count 2107
Deduced a syphon composed of 430 places in 1 ms
Iterating global reduction 7 with 6 rules applied. Total rules applied 2335 place count 1059 transition count 2107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 2338 place count 1059 transition count 2137
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2341 place count 1056 transition count 2131
Deduced a syphon composed of 430 places in 0 ms
Iterating global reduction 7 with 3 rules applied. Total rules applied 2344 place count 1056 transition count 2131
Deduced a syphon composed of 430 places in 1 ms
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 7 with 52 rules applied. Total rules applied 2396 place count 1056 transition count 2079
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2414 place count 1038 transition count 2043
Deduced a syphon composed of 430 places in 1 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2432 place count 1038 transition count 2043
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2450 place count 1020 transition count 1803
Deduced a syphon composed of 430 places in 1 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2468 place count 1020 transition count 1803
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2495 place count 1020 transition count 1776
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2513 place count 1002 transition count 1749
Deduced a syphon composed of 412 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2531 place count 1002 transition count 1749
Deduced a syphon composed of 412 places in 1 ms
Applied a total of 2531 rules in 1764 ms. Remains 1002 /2171 variables (removed 1169) and now considering 1749/3977 (removed 2228) transitions.
[2023-03-09 13:13:15] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-09 13:13:15] [INFO ] Flow matrix only has 1719 transitions (discarded 30 similar events)
// Phase 1: matrix 1719 rows 1002 cols
[2023-03-09 13:13:15] [INFO ] Computed 184 place invariants in 63 ms
[2023-03-09 13:13:16] [INFO ] Dead Transitions using invariants and state equation in 1030 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1002/2171 places, 1749/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2909 ms. Remains : 1002/2171 places, 1749/3977 transitions.
Support contains 4 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 72 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-09 13:13:17] [INFO ] Computed 184 place invariants in 9 ms
[2023-03-09 13:13:17] [INFO ] Implicit Places using invariants in 819 ms returned []
[2023-03-09 13:13:17] [INFO ] Invariant cache hit.
[2023-03-09 13:13:19] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
[2023-03-09 13:13:19] [INFO ] Invariant cache hit.
[2023-03-09 13:13:21] [INFO ] Dead Transitions using invariants and state equation in 1920 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4918 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Treatment of property DLCround-PT-09b-LTLFireability-11 finished in 46265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1923 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 1 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1693 transition count 3177
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 376 rules applied. Total rules applied 710 place count 1360 transition count 3134
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 738 place count 1332 transition count 3134
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 738 place count 1332 transition count 2952
Deduced a syphon composed of 182 places in 12 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1102 place count 1150 transition count 2952
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1175 place count 1077 transition count 2327
Iterating global reduction 3 with 73 rules applied. Total rules applied 1248 place count 1077 transition count 2327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1252 place count 1077 transition count 2323
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1252 place count 1077 transition count 2321
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1256 place count 1075 transition count 2321
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2080 place count 663 transition count 1899
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2090 place count 663 transition count 1889
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2113 place count 640 transition count 1599
Iterating global reduction 5 with 23 rules applied. Total rules applied 2136 place count 640 transition count 1599
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2159 place count 640 transition count 1576
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2183 place count 628 transition count 1683
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2187 place count 628 transition count 1679
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2191 place count 624 transition count 1595
Iterating global reduction 7 with 4 rules applied. Total rules applied 2195 place count 624 transition count 1595
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2199 place count 624 transition count 1591
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2207 place count 620 transition count 1625
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2246 place count 620 transition count 1586
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2265 place count 601 transition count 1548
Iterating global reduction 8 with 19 rules applied. Total rules applied 2284 place count 601 transition count 1548
Discarding 19 places :
Symmetric choice reduction at 8 with 19 rule applications. Total rules 2303 place count 582 transition count 1297
Iterating global reduction 8 with 19 rules applied. Total rules applied 2322 place count 582 transition count 1297
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 2341 place count 582 transition count 1278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2342 place count 581 transition count 1277
Applied a total of 2342 rules in 369 ms. Remains 581 /2187 variables (removed 1606) and now considering 1277/4042 (removed 2765) transitions.
[2023-03-09 13:13:22] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
// Phase 1: matrix 1248 rows 581 cols
[2023-03-09 13:13:22] [INFO ] Computed 184 place invariants in 2 ms
[2023-03-09 13:13:23] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-09 13:13:23] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
[2023-03-09 13:13:23] [INFO ] Invariant cache hit.
[2023-03-09 13:13:23] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-09 13:13:23] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2023-03-09 13:13:23] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-09 13:13:23] [INFO ] Flow matrix only has 1248 transitions (discarded 29 similar events)
[2023-03-09 13:13:23] [INFO ] Invariant cache hit.
[2023-03-09 13:13:24] [INFO ] Dead Transitions using invariants and state equation in 463 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/2187 places, 1277/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1777 ms. Remains : 581/2187 places, 1277/4042 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s35 1) (EQ s382 1)) (AND (EQ s13 1) (EQ s279 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-12 finished in 1837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)||p0))||G(p2))))'
Support contains 5 out of 2187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 516 / 2187 are part of one of the 45 SCC in 1 ms
Free SCC test removed 471 places
Ensure Unique test removed 506 transitions
Reduce isomorphic transitions removed 506 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 343 place count 1715 transition count 3193
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 385 rules applied. Total rules applied 728 place count 1373 transition count 3150
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 756 place count 1345 transition count 3150
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 185 Pre rules applied. Total rules applied 756 place count 1345 transition count 2965
Deduced a syphon composed of 185 places in 12 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 3 with 370 rules applied. Total rules applied 1126 place count 1160 transition count 2965
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 1195 place count 1091 transition count 2368
Iterating global reduction 3 with 69 rules applied. Total rules applied 1264 place count 1091 transition count 2368
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1268 place count 1091 transition count 2364
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1268 place count 1091 transition count 2362
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1272 place count 1089 transition count 2362
Performed 416 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 416 places in 0 ms
Reduce places removed 416 places and 0 transitions.
Iterating global reduction 4 with 832 rules applied. Total rules applied 2104 place count 673 transition count 1938
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2114 place count 673 transition count 1928
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2137 place count 650 transition count 1641
Iterating global reduction 5 with 23 rules applied. Total rules applied 2160 place count 650 transition count 1641
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 2182 place count 650 transition count 1619
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2184 place count 649 transition count 1618
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2208 place count 637 transition count 1725
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2212 place count 637 transition count 1721
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2216 place count 633 transition count 1637
Iterating global reduction 7 with 4 rules applied. Total rules applied 2220 place count 633 transition count 1637
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2224 place count 633 transition count 1633
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2232 place count 629 transition count 1667
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 2271 place count 629 transition count 1628
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2289 place count 611 transition count 1592
Iterating global reduction 8 with 18 rules applied. Total rules applied 2307 place count 611 transition count 1592
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2325 place count 593 transition count 1354
Iterating global reduction 8 with 18 rules applied. Total rules applied 2343 place count 593 transition count 1354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2361 place count 593 transition count 1336
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 2362 place count 592 transition count 1335
Applied a total of 2362 rules in 448 ms. Remains 592 /2187 variables (removed 1595) and now considering 1335/4042 (removed 2707) transitions.
[2023-03-09 13:13:24] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
// Phase 1: matrix 1304 rows 592 cols
[2023-03-09 13:13:24] [INFO ] Computed 184 place invariants in 6 ms
[2023-03-09 13:13:25] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-09 13:13:25] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
[2023-03-09 13:13:25] [INFO ] Invariant cache hit.
[2023-03-09 13:13:25] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-09 13:13:25] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-09 13:13:25] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-09 13:13:25] [INFO ] Flow matrix only has 1304 transitions (discarded 31 similar events)
[2023-03-09 13:13:25] [INFO ] Invariant cache hit.
[2023-03-09 13:13:26] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 592/2187 places, 1335/4042 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1887 ms. Remains : 592/2187 places, 1335/4042 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s549 0)), p1:(EQ s84 0), p2:(OR (NEQ s29 1) (NEQ s123 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5452 steps with 1 reset in 49 ms.
FORMULA DLCround-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-09b-LTLFireability-13 finished in 2027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 602 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-09 13:13:26] [INFO ] Computed 184 place invariants in 17 ms
[2023-03-09 13:13:27] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-09 13:13:27] [INFO ] Invariant cache hit.
[2023-03-09 13:13:29] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2023-03-09 13:13:29] [INFO ] Invariant cache hit.
[2023-03-09 13:13:31] [INFO ] Dead Transitions using invariants and state equation in 2161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5463 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s84 1) (EQ s1268 1)), p2:(OR (EQ s78 0) (EQ s1311 0)), p0:(OR (EQ s709 0) (EQ s1983 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 645 ms.
Product exploration explored 100000 steps with 0 reset in 910 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1120 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 13:13:35] [INFO ] Invariant cache hit.
[2023-03-09 13:13:35] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 13:13:36] [INFO ] [Nat]Absence check using 184 positive place invariants in 130 ms returned sat
[2023-03-09 13:13:38] [INFO ] After 1888ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-09 13:13:39] [INFO ] After 3174ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 693 ms.
[2023-03-09 13:13:40] [INFO ] After 4701ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 6 different solutions.
Finished Parikh walk after 701 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=140 )
Parikh walk visited 7 properties in 52 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 27 factoid took 1384 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 81 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-09 13:13:42] [INFO ] Invariant cache hit.
[2023-03-09 13:13:42] [INFO ] Implicit Places using invariants in 608 ms returned []
[2023-03-09 13:13:42] [INFO ] Invariant cache hit.
[2023-03-09 13:13:45] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2659 ms to find 0 implicit places.
[2023-03-09 13:13:45] [INFO ] Invariant cache hit.
[2023-03-09 13:13:46] [INFO ] Dead Transitions using invariants and state equation in 1875 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4620 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1370 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 13:13:49] [INFO ] Invariant cache hit.
[2023-03-09 13:13:49] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 13:13:50] [INFO ] [Nat]Absence check using 184 positive place invariants in 134 ms returned sat
[2023-03-09 13:13:52] [INFO ] After 2050ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-09 13:13:54] [INFO ] After 3467ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 790 ms.
[2023-03-09 13:13:54] [INFO ] After 5174ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 690 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=172 )
Parikh walk visited 8 properties in 84 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (AND (NOT p2) p0)), (F (AND p2 p0 p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 26 factoid took 1361 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 231 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 138 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 616 ms.
Product exploration explored 100000 steps with 0 reset in 797 ms.
Support contains 6 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 99 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-09 13:13:58] [INFO ] Invariant cache hit.
[2023-03-09 13:13:58] [INFO ] Implicit Places using invariants in 609 ms returned []
[2023-03-09 13:13:58] [INFO ] Invariant cache hit.
[2023-03-09 13:14:01] [INFO ] Implicit Places using invariants and state equation in 2041 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2023-03-09 13:14:01] [INFO ] Invariant cache hit.
[2023-03-09 13:14:02] [INFO ] Dead Transitions using invariants and state equation in 1838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4613 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 36773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2178 transition count 3985
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2178 transition count 3985
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 2178 transition count 3984
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 2176 transition count 3982
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 2176 transition count 3982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 2175 transition count 3981
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 2175 transition count 3981
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 2174 transition count 3980
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 2174 transition count 3980
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 2173 transition count 3979
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 2173 transition count 3979
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 2172 transition count 3978
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 2172 transition count 3978
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 2171 transition count 3977
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 2171 transition count 3977
Applied a total of 33 rules in 603 ms. Remains 2171 /2187 variables (removed 16) and now considering 3977/4042 (removed 65) transitions.
[2023-03-09 13:14:03] [INFO ] Invariant cache hit.
[2023-03-09 13:14:04] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-09 13:14:04] [INFO ] Invariant cache hit.
[2023-03-09 13:14:06] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2662 ms to find 0 implicit places.
[2023-03-09 13:14:06] [INFO ] Invariant cache hit.
[2023-03-09 13:14:08] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2171/2187 places, 3977/4042 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5032 ms. Remains : 2171/2187 places, 3977/4042 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s691 1), p0:(OR (EQ s939 0) (EQ s2133 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 576 ms.
Product exploration explored 100000 steps with 8 reset in 681 ms.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6559 steps, including 1 resets, run visited all 3 properties in 71 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 309 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 75 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
[2023-03-09 13:14:10] [INFO ] Invariant cache hit.
[2023-03-09 13:14:11] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-09 13:14:11] [INFO ] Invariant cache hit.
[2023-03-09 13:14:13] [INFO ] Implicit Places using invariants and state equation in 2111 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
[2023-03-09 13:14:13] [INFO ] Invariant cache hit.
[2023-03-09 13:14:15] [INFO ] Dead Transitions using invariants and state equation in 1772 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4602 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Computed a total of 363 stabilizing places and 363 stable transitions
Computed a total of 363 stabilizing places and 363 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 13:14:15] [INFO ] Invariant cache hit.
[2023-03-09 13:14:16] [INFO ] [Real]Absence check using 184 positive place invariants in 138 ms returned sat
[2023-03-09 13:14:17] [INFO ] After 1375ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 13:14:17] [INFO ] After 1554ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-09 13:14:17] [INFO ] After 2080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 259 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 12 reset in 564 ms.
Product exploration explored 100000 steps with 7 reset in 681 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Graph (trivial) has 1909 edges and 2171 vertex of which 524 / 2171 are part of one of the 43 SCC in 1 ms
Free SCC test removed 481 places
Ensure Unique test removed 519 transitions
Reduce isomorphic transitions removed 519 transitions.
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 1690 transition count 3458
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 28 rules applied. Total rules applied 362 place count 1690 transition count 3444
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 362 place count 1690 transition count 3448
Deduced a syphon composed of 355 places in 14 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 370 place count 1690 transition count 3448
Discarding 152 places :
Symmetric choice reduction at 2 with 152 rule applications. Total rules 522 place count 1538 transition count 2804
Deduced a syphon composed of 269 places in 11 ms
Iterating global reduction 2 with 152 rules applied. Total rules applied 674 place count 1538 transition count 2804
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 678 place count 1538 transition count 2800
Performed 584 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 853 places in 1 ms
Iterating global reduction 3 with 584 rules applied. Total rules applied 1262 place count 1538 transition count 2810
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 1272 place count 1538 transition count 2800
Renaming transitions due to excessive name length > 1024 char.
Discarding 425 places :
Symmetric choice reduction at 4 with 425 rule applications. Total rules 1697 place count 1113 transition count 2087
Deduced a syphon composed of 453 places in 0 ms
Iterating global reduction 4 with 425 rules applied. Total rules applied 2122 place count 1113 transition count 2087
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 2146 place count 1113 transition count 2063
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2156 place count 1103 transition count 2053
Deduced a syphon composed of 443 places in 1 ms
Iterating global reduction 5 with 10 rules applied. Total rules applied 2166 place count 1103 transition count 2053
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -208
Deduced a syphon composed of 474 places in 0 ms
Iterating global reduction 5 with 31 rules applied. Total rules applied 2197 place count 1103 transition count 2261
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 2215 place count 1103 transition count 2243
Discarding 45 places :
Symmetric choice reduction at 6 with 45 rule applications. Total rules 2260 place count 1058 transition count 2071
Deduced a syphon composed of 433 places in 0 ms
Iterating global reduction 6 with 45 rules applied. Total rules applied 2305 place count 1058 transition count 2071
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2313 place count 1058 transition count 2063
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2321 place count 1050 transition count 2047
Deduced a syphon composed of 425 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 2329 place count 1050 transition count 2047
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 429 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2333 place count 1050 transition count 2087
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2337 place count 1046 transition count 2079
Deduced a syphon composed of 425 places in 0 ms
Iterating global reduction 7 with 4 rules applied. Total rules applied 2341 place count 1046 transition count 2079
Deduced a syphon composed of 425 places in 1 ms
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 2377 place count 1046 transition count 2043
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2395 place count 1028 transition count 2007
Deduced a syphon composed of 425 places in 0 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2413 place count 1028 transition count 2007
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2431 place count 1010 transition count 1771
Deduced a syphon composed of 425 places in 1 ms
Iterating global reduction 7 with 18 rules applied. Total rules applied 2449 place count 1010 transition count 1771
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 7 with 27 rules applied. Total rules applied 2476 place count 1010 transition count 1744
Discarding 18 places :
Symmetric choice reduction at 8 with 18 rule applications. Total rules 2494 place count 992 transition count 1717
Deduced a syphon composed of 407 places in 0 ms
Iterating global reduction 8 with 18 rules applied. Total rules applied 2512 place count 992 transition count 1717
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 408 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2513 place count 992 transition count 1729
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2514 place count 991 transition count 1727
Deduced a syphon composed of 407 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 2515 place count 991 transition count 1727
Deduced a syphon composed of 407 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2518 place count 991 transition count 1724
Deduced a syphon composed of 407 places in 0 ms
Applied a total of 2518 rules in 1279 ms. Remains 991 /2171 variables (removed 1180) and now considering 1724/3977 (removed 2253) transitions.
[2023-03-09 13:14:21] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-09 13:14:21] [INFO ] Flow matrix only has 1692 transitions (discarded 32 similar events)
// Phase 1: matrix 1692 rows 991 cols
[2023-03-09 13:14:21] [INFO ] Computed 184 place invariants in 60 ms
[2023-03-09 13:14:22] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 991/2171 places, 1724/3977 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2167 ms. Remains : 991/2171 places, 1724/3977 transitions.
Support contains 3 out of 2171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2171/2171 places, 3977/3977 transitions.
Applied a total of 0 rules in 73 ms. Remains 2171 /2171 variables (removed 0) and now considering 3977/3977 (removed 0) transitions.
// Phase 1: matrix 3977 rows 2171 cols
[2023-03-09 13:14:22] [INFO ] Computed 184 place invariants in 17 ms
[2023-03-09 13:14:22] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-09 13:14:22] [INFO ] Invariant cache hit.
[2023-03-09 13:14:24] [INFO ] Implicit Places using invariants and state equation in 2084 ms returned []
Implicit Place search using SMT with State Equation took 2761 ms to find 0 implicit places.
[2023-03-09 13:14:24] [INFO ] Invariant cache hit.
[2023-03-09 13:14:26] [INFO ] Dead Transitions using invariants and state equation in 1808 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4643 ms. Remains : 2171/2171 places, 3977/3977 transitions.
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 23864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G((!p0||X(p2)))&&(!p0 U (p1||G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G((!(!p1 U X(p1))||p0))||X(X(p2))))))'
Found a Lengthening insensitive property : DLCround-PT-09b-LTLFireability-14
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1921 edges and 2187 vertex of which 537 / 2187 are part of one of the 44 SCC in 2 ms
Free SCC test removed 493 places
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 332 transitions
Trivial Post-agglo rules discarded 332 transitions
Performed 332 trivial Post agglomeration. Transition count delta: 332
Iterating post reduction 0 with 332 rules applied. Total rules applied 333 place count 1693 transition count 3178
Reduce places removed 332 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 375 rules applied. Total rules applied 708 place count 1361 transition count 3135
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 736 place count 1333 transition count 3135
Performed 182 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 182 Pre rules applied. Total rules applied 736 place count 1333 transition count 2953
Deduced a syphon composed of 182 places in 13 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 364 rules applied. Total rules applied 1100 place count 1151 transition count 2953
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1173 place count 1078 transition count 2328
Iterating global reduction 3 with 73 rules applied. Total rules applied 1246 place count 1078 transition count 2328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1250 place count 1078 transition count 2324
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1250 place count 1078 transition count 2322
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1254 place count 1076 transition count 2322
Performed 412 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 412 places in 0 ms
Reduce places removed 412 places and 0 transitions.
Iterating global reduction 4 with 824 rules applied. Total rules applied 2078 place count 664 transition count 1900
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2088 place count 664 transition count 1890
Renaming transitions due to excessive name length > 1024 char.
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 2111 place count 641 transition count 1600
Iterating global reduction 5 with 23 rules applied. Total rules applied 2134 place count 641 transition count 1600
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 2157 place count 641 transition count 1577
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2181 place count 629 transition count 1691
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 2184 place count 629 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2187 place count 626 transition count 1624
Iterating global reduction 7 with 3 rules applied. Total rules applied 2190 place count 626 transition count 1624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 2193 place count 626 transition count 1621
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 2199 place count 623 transition count 1646
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2203 place count 623 transition count 1642
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2204 place count 622 transition count 1641
Applied a total of 2204 rules in 351 ms. Remains 622 /2187 variables (removed 1565) and now considering 1641/4042 (removed 2401) transitions.
[2023-03-09 13:14:27] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
// Phase 1: matrix 1593 rows 622 cols
[2023-03-09 13:14:27] [INFO ] Computed 184 place invariants in 9 ms
[2023-03-09 13:14:27] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-09 13:14:27] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:27] [INFO ] Invariant cache hit.
[2023-03-09 13:14:28] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:28] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-09 13:14:28] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:28] [INFO ] Invariant cache hit.
[2023-03-09 13:14:29] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 622/2187 places, 1641/4042 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1959 ms. Remains : 622/2187 places, 1641/4042 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s170 1)), p2:(OR (EQ s7 0) (EQ s192 0)), p0:(OR (EQ s83 0) (EQ s528 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1076 ms.
Product exploration explored 100000 steps with 0 reset in 1230 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 882 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 13:14:32] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:32] [INFO ] Invariant cache hit.
[2023-03-09 13:14:33] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 13:14:33] [INFO ] [Nat]Absence check using 184 positive place invariants in 26 ms returned sat
[2023-03-09 13:14:33] [INFO ] After 373ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-09 13:14:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:33] [INFO ] After 43ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2023-03-09 13:14:33] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 13:14:33] [INFO ] After 670ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 1 with 58 rules applied. Total rules applied 105 place count 593 transition count 1916
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 108 place count 593 transition count 1913
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 127 place count 574 transition count 1417
Iterating global reduction 2 with 19 rules applied. Total rules applied 146 place count 574 transition count 1417
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 165 place count 574 transition count 1398
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 3 with 145 rules applied. Total rules applied 310 place count 574 transition count 1253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 320 place count 564 transition count 1122
Iterating global reduction 3 with 10 rules applied. Total rules applied 330 place count 564 transition count 1122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 340 place count 564 transition count 1112
Free-agglomeration rule applied 363 times with reduction of 194 identical transitions.
Iterating global reduction 4 with 363 rules applied. Total rules applied 703 place count 564 transition count 555
Reduce places removed 372 places and 0 transitions.
Drop transitions removed 386 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 344 edges and 192 vertex of which 45 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.1 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 4 with 760 rules applied. Total rules applied 1463 place count 45 transition count 100
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 1480 place count 45 transition count 83
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 1504 place count 21 transition count 38
Iterating global reduction 6 with 24 rules applied. Total rules applied 1528 place count 21 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1530 place count 20 transition count 37
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1535 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1536 place count 19 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 1537 place count 19 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1538 place count 19 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1539 place count 18 transition count 28
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 1548 place count 12 transition count 24
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1555 place count 12 transition count 17
Applied a total of 1555 rules in 156 ms. Remains 12 /622 variables (removed 610) and now considering 17/1641 (removed 1624) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 12/622 places, 17/1641 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND p0 p1 (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p1) p2))), (F (AND p0 p1 p2)), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1) p2)))]
Knowledge based reduction with 27 factoid took 1192 ms. Reduced automaton from 3 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 14 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2023-03-09 13:14:35] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:35] [INFO ] Invariant cache hit.
[2023-03-09 13:14:35] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-09 13:14:35] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:35] [INFO ] Invariant cache hit.
[2023-03-09 13:14:36] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:36] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-09 13:14:36] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:36] [INFO ] Invariant cache hit.
[2023-03-09 13:14:36] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1531 ms. Remains : 622/622 places, 1641/1641 transitions.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1337 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 13:14:38] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:38] [INFO ] Invariant cache hit.
[2023-03-09 13:14:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 13:14:38] [INFO ] [Nat]Absence check using 184 positive place invariants in 26 ms returned sat
[2023-03-09 13:14:39] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 13:14:39] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:39] [INFO ] After 49ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-09 13:14:39] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-09 13:14:39] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 622 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 621 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 621 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 621 transition count 1583
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 108 place count 592 transition count 1905
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 111 place count 592 transition count 1902
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 130 place count 573 transition count 1406
Iterating global reduction 3 with 19 rules applied. Total rules applied 149 place count 573 transition count 1406
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 168 place count 573 transition count 1387
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 4 with 145 rules applied. Total rules applied 313 place count 573 transition count 1242
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 323 place count 563 transition count 1111
Iterating global reduction 4 with 10 rules applied. Total rules applied 333 place count 563 transition count 1111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 343 place count 563 transition count 1101
Free-agglomeration rule applied 364 times with reduction of 195 identical transitions.
Iterating global reduction 5 with 364 rules applied. Total rules applied 707 place count 563 transition count 542
Reduce places removed 373 places and 0 transitions.
Drop transitions removed 387 transitions
Reduce isomorphic transitions removed 387 transitions.
Graph (complete) has 328 edges and 190 vertex of which 43 are kept as prefixes of interest. Removing 147 places using SCC suffix rule.0 ms
Discarding 147 places :
Also discarding 68 output transitions
Drop transitions removed 68 transitions
Iterating post reduction 5 with 761 rules applied. Total rules applied 1468 place count 43 transition count 87
Drop transitions removed 3 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 1485 place count 43 transition count 70
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 1510 place count 18 transition count 30
Iterating global reduction 7 with 25 rules applied. Total rules applied 1535 place count 18 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1537 place count 17 transition count 29
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1542 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1543 place count 16 transition count 22
Iterating global reduction 8 with 1 rules applied. Total rules applied 1544 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1545 place count 15 transition count 21
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 5 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 1553 place count 9 transition count 18
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 1559 place count 9 transition count 12
Applied a total of 1559 rules in 136 ms. Remains 9 /622 variables (removed 613) and now considering 12/1641 (removed 1629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 9/622 places, 12/1641 transitions.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 p2)), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p0 (NOT p1)))), (F (AND (NOT p2) p0)), (F (AND p2 p0 p1)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1)))]
Knowledge based reduction with 26 factoid took 1562 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 1012 ms.
Product exploration explored 100000 steps with 0 reset in 1145 ms.
Support contains 6 out of 622 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1641/1641 transitions.
Applied a total of 0 rules in 11 ms. Remains 622 /622 variables (removed 0) and now considering 1641/1641 (removed 0) transitions.
[2023-03-09 13:14:43] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:43] [INFO ] Invariant cache hit.
[2023-03-09 13:14:44] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-09 13:14:44] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:44] [INFO ] Invariant cache hit.
[2023-03-09 13:14:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:44] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2023-03-09 13:14:44] [INFO ] Flow matrix only has 1593 transitions (discarded 48 similar events)
[2023-03-09 13:14:44] [INFO ] Invariant cache hit.
[2023-03-09 13:14:45] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1521 ms. Remains : 622/622 places, 1641/1641 transitions.
Treatment of property DLCround-PT-09b-LTLFireability-14 finished in 18412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : DLCround-PT-09b-LTLFireability-15
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 2187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2187/2187 places, 4042/4042 transitions.
Graph (trivial) has 1922 edges and 2187 vertex of which 531 / 2187 are part of one of the 43 SCC in 1 ms
Free SCC test removed 488 places
Ensure Unique test removed 526 transitions
Reduce isomorphic transitions removed 526 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 334 transitions
Trivial Post-agglo rules discarded 334 transitions
Performed 334 trivial Post agglomeration. Transition count delta: 334
Iterating post reduction 0 with 334 rules applied. Total rules applied 335 place count 1698 transition count 3181
Reduce places removed 334 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 377 rules applied. Total rules applied 712 place count 1364 transition count 3138
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 740 place count 1336 transition count 3138
Performed 183 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 183 Pre rules applied. Total rules applied 740 place count 1336 transition count 2955
Deduced a syphon composed of 183 places in 12 ms
Reduce places removed 183 places and 0 transitions.
Iterating global reduction 3 with 366 rules applied. Total rules applied 1106 place count 1153 transition count 2955
Discarding 72 places :
Symmetric choice reduction at 3 with 72 rule applications. Total rules 1178 place count 1081 transition count 2343
Iterating global reduction 3 with 72 rules applied. Total rules applied 1250 place count 1081 transition count 2343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1254 place count 1081 transition count 2339
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1254 place count 1081 transition count 2337
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1258 place count 1079 transition count 2337
Performed 413 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 413 places in 1 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 4 with 826 rules applied. Total rules applied 2084 place count 666 transition count 1914
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2094 place count 666 transition count 1904
Renaming transitions due to excessive name length > 1024 char.
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2119 place count 641 transition count 1591
Iterating global reduction 5 with 25 rules applied. Total rules applied 2144 place count 641 transition count 1591
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2168 place count 641 transition count 1567
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 2194 place count 628 transition count 1686
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2198 place count 628 transition count 1682
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2202 place count 624 transition count 1598
Iterating global reduction 7 with 4 rules applied. Total rules applied 2206 place count 624 transition count 1598
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2210 place count 624 transition count 1594
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 2218 place count 620 transition count 1628
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2222 place count 620 transition count 1624
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2223 place count 619 transition count 1623
Applied a total of 2223 rules in 273 ms. Remains 619 /2187 variables (removed 1568) and now considering 1623/4042 (removed 2419) transitions.
[2023-03-09 13:14:45] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
// Phase 1: matrix 1574 rows 619 cols
[2023-03-09 13:14:45] [INFO ] Computed 184 place invariants in 8 ms
[2023-03-09 13:14:46] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-09 13:14:46] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
[2023-03-09 13:14:46] [INFO ] Invariant cache hit.
[2023-03-09 13:14:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-09 13:14:46] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2023-03-09 13:14:46] [INFO ] Flow matrix only has 1574 transitions (discarded 49 similar events)
[2023-03-09 13:14:46] [INFO ] Invariant cache hit.
[2023-03-09 13:14:47] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 619/2187 places, 1623/4042 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1843 ms. Remains : 619/2187 places, 1623/4042 transitions.
Running random walk in product with property : DLCround-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s77 1), p0:(OR (EQ s106 0) (EQ s600 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 439 steps with 0 reset in 6 ms.
Treatment of property DLCround-PT-09b-LTLFireability-15 finished in 2065 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-09 13:14:47] [INFO ] Flatten gal took : 111 ms
[2023-03-09 13:14:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-09 13:14:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2187 places, 4042 transitions and 12131 arcs took 19 ms.
Total runtime 193486 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2484/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2484/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2484/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-11
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-14
Could not compute solution for formula : DLCround-PT-09b-LTLFireability-15

BK_STOP 1678367695120

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DLCround-PT-09b-LTLFireability-11
ltl formula formula --ltl=/tmp/2484/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2187 places, 4042 transitions and 12131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.510 real 0.070 user 0.110 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2484/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2484/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2484/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2484/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DLCround-PT-09b-LTLFireability-14
ltl formula formula --ltl=/tmp/2484/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2187 places, 4042 transitions and 12131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.120 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2484/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2484/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2484/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2484/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DLCround-PT-09b-LTLFireability-15
ltl formula formula --ltl=/tmp/2484/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2187 places, 4042 transitions and 12131 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.580 real 0.120 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2484/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2484/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2484/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2484/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="DLCround-PT-09b"
export BK_EXAMINATION="LTLFireability"
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 DLCround-PT-09b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481600724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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