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.r263-smll-167863538000268.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 lolaxred
Input is NoC3x3-PT-3B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538000268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 7.7K Feb 26 09:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 09:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 09:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 581K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678755840786

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 01:04:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 01:04:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 01:04:04] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2023-03-14 01:04:04] [INFO ] Transformed 2117 places.
[2023-03-14 01:04:04] [INFO ] Transformed 2435 transitions.
[2023-03-14 01:04:04] [INFO ] Found NUPN structural information;
[2023-03-14 01:04:04] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 633 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-3B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 2112 transition count 2435
Discarding 532 places :
Symmetric choice reduction at 1 with 532 rule applications. Total rules 537 place count 1580 transition count 1903
Iterating global reduction 1 with 532 rules applied. Total rules applied 1069 place count 1580 transition count 1903
Discarding 181 places :
Symmetric choice reduction at 1 with 181 rule applications. Total rules 1250 place count 1399 transition count 1722
Iterating global reduction 1 with 181 rules applied. Total rules applied 1431 place count 1399 transition count 1722
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1433 place count 1399 transition count 1720
Discarding 201 places :
Symmetric choice reduction at 2 with 201 rule applications. Total rules 1634 place count 1198 transition count 1504
Iterating global reduction 2 with 201 rules applied. Total rules applied 1835 place count 1198 transition count 1504
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 1891 place count 1142 transition count 1399
Iterating global reduction 2 with 56 rules applied. Total rules applied 1947 place count 1142 transition count 1399
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 17 rules applied. Total rules applied 1964 place count 1140 transition count 1384
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 2002 place count 1102 transition count 1346
Iterating global reduction 3 with 38 rules applied. Total rules applied 2040 place count 1102 transition count 1346
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 2044 place count 1098 transition count 1346
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 2071 place count 1071 transition count 1292
Iterating global reduction 4 with 27 rules applied. Total rules applied 2098 place count 1071 transition count 1292
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 2125 place count 1044 transition count 1265
Iterating global reduction 4 with 27 rules applied. Total rules applied 2152 place count 1044 transition count 1265
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 2157 place count 1039 transition count 1265
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2182 place count 1014 transition count 1240
Iterating global reduction 5 with 25 rules applied. Total rules applied 2207 place count 1014 transition count 1240
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 2232 place count 1014 transition count 1215
Applied a total of 2232 rules in 1815 ms. Remains 1014 /2117 variables (removed 1103) and now considering 1215/2435 (removed 1220) transitions.
// Phase 1: matrix 1215 rows 1014 cols
[2023-03-14 01:04:06] [INFO ] Computed 54 place invariants in 34 ms
[2023-03-14 01:04:07] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2023-03-14 01:04:07] [INFO ] Invariant cache hit.
[2023-03-14 01:04:09] [INFO ] Implicit Places using invariants and state equation in 1882 ms returned [72, 80, 137, 144, 145, 153, 156, 254, 257, 261, 262, 324, 325, 340, 344, 435, 436, 437, 438, 442, 443, 444, 452, 458, 466, 469, 472, 645, 647, 651, 653, 654, 658, 659, 661, 768, 769, 777, 835, 836, 837, 841, 851, 854, 957, 961]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 3015 ms to find 46 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 968/2117 places, 1215/2435 transitions.
Applied a total of 0 rules in 48 ms. Remains 968 /968 variables (removed 0) and now considering 1215/1215 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4879 ms. Remains : 968/2117 places, 1215/2435 transitions.
Support contains 41 out of 968 places after structural reductions.
[2023-03-14 01:04:10] [INFO ] Flatten gal took : 173 ms
[2023-03-14 01:04:10] [INFO ] Flatten gal took : 94 ms
[2023-03-14 01:04:10] [INFO ] Input system was already deterministic with 1215 transitions.
Support contains 38 out of 968 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1215 rows 968 cols
[2023-03-14 01:04:11] [INFO ] Computed 42 place invariants in 12 ms
[2023-03-14 01:04:12] [INFO ] [Real]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-14 01:04:12] [INFO ] After 513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-14 01:04:12] [INFO ] [Nat]Absence check using 42 positive place invariants in 33 ms returned sat
[2023-03-14 01:04:13] [INFO ] After 1020ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-14 01:04:14] [INFO ] After 1826ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-03-14 01:04:15] [INFO ] After 2813ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 147 ms.
Support contains 3 out of 968 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Graph (trivial) has 775 edges and 968 vertex of which 72 / 968 are part of one of the 9 SCC in 7 ms
Free SCC test removed 63 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 905 transition count 1012
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 267 place count 774 transition count 1008
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 269 place count 773 transition count 1007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 270 place count 772 transition count 1007
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 270 place count 772 transition count 923
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 438 place count 688 transition count 923
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 470 place count 656 transition count 862
Iterating global reduction 4 with 32 rules applied. Total rules applied 502 place count 656 transition count 862
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 502 place count 656 transition count 860
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 506 place count 654 transition count 860
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 511 place count 649 transition count 850
Iterating global reduction 4 with 5 rules applied. Total rules applied 516 place count 649 transition count 850
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 517 place count 649 transition count 849
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 519 place count 647 transition count 847
Iterating global reduction 5 with 2 rules applied. Total rules applied 521 place count 647 transition count 847
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 523 place count 647 transition count 845
Performed 333 Post agglomeration using F-continuation condition.Transition count delta: 333
Deduced a syphon composed of 333 places in 0 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 6 with 666 rules applied. Total rules applied 1189 place count 314 transition count 512
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1202 place count 301 transition count 489
Iterating global reduction 6 with 13 rules applied. Total rules applied 1215 place count 301 transition count 489
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1218 place count 301 transition count 486
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1222 place count 297 transition count 478
Iterating global reduction 7 with 4 rules applied. Total rules applied 1226 place count 297 transition count 478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1227 place count 297 transition count 477
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1229 place count 295 transition count 472
Iterating global reduction 8 with 2 rules applied. Total rules applied 1231 place count 295 transition count 472
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -37
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 1265 place count 278 transition count 509
Free-agglomeration rule applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1288 place count 278 transition count 486
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 30 rules applied. Total rules applied 1318 place count 255 transition count 479
Free-agglomeration rule (complex) applied 39 times.
Iterating global reduction 9 with 39 rules applied. Total rules applied 1357 place count 255 transition count 451
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 48 rules applied. Total rules applied 1405 place count 216 transition count 442
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1406 place count 216 transition count 442
Applied a total of 1406 rules in 355 ms. Remains 216 /968 variables (removed 752) and now considering 442/1215 (removed 773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 216/968 places, 442/1215 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 540578 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 540578 steps, saw 73346 distinct states, run finished after 3002 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 01:04:18] [INFO ] Flow matrix only has 438 transitions (discarded 4 similar events)
// Phase 1: matrix 438 rows 216 cols
[2023-03-14 01:04:18] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-14 01:04:19] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 01:04:19] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-14 01:04:19] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 01:04:19] [INFO ] State equation strengthened by 138 read => feed constraints.
[2023-03-14 01:04:19] [INFO ] After 98ms SMT Verify possible using 138 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-14 01:04:19] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-14 01:04:19] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 442/442 transitions.
Applied a total of 0 rules in 29 ms. Remains 216 /216 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 216/216 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 442/442 transitions.
Applied a total of 0 rules in 22 ms. Remains 216 /216 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2023-03-14 01:04:19] [INFO ] Flow matrix only has 438 transitions (discarded 4 similar events)
[2023-03-14 01:04:19] [INFO ] Invariant cache hit.
[2023-03-14 01:04:19] [INFO ] Implicit Places using invariants in 321 ms returned [7, 28, 54, 78, 108, 146, 167, 185, 207]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 324 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/216 places, 442/442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 441
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 206 transition count 440
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 49 place count 183 transition count 417
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 73 place count 183 transition count 393
Applied a total of 73 rules in 36 ms. Remains 183 /207 variables (removed 24) and now considering 393/442 (removed 49) transitions.
[2023-03-14 01:04:20] [INFO ] Flow matrix only has 389 transitions (discarded 4 similar events)
// Phase 1: matrix 389 rows 183 cols
[2023-03-14 01:04:20] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-14 01:04:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-14 01:04:20] [INFO ] Flow matrix only has 389 transitions (discarded 4 similar events)
[2023-03-14 01:04:20] [INFO ] Invariant cache hit.
[2023-03-14 01:04:20] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-14 01:04:20] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [19, 65, 82, 90, 120, 138, 172]
Discarding 7 places :
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Implicit Place search using SMT with State Equation took 910 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 176/216 places, 383/442 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 176 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 175 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 173 transition count 380
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 173 transition count 376
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 169 transition count 374
Applied a total of 16 rules in 33 ms. Remains 169 /176 variables (removed 7) and now considering 374/383 (removed 9) transitions.
[2023-03-14 01:04:20] [INFO ] Flow matrix only has 370 transitions (discarded 4 similar events)
// Phase 1: matrix 370 rows 169 cols
[2023-03-14 01:04:20] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-14 01:04:21] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-14 01:04:21] [INFO ] Flow matrix only has 370 transitions (discarded 4 similar events)
[2023-03-14 01:04:21] [INFO ] Invariant cache hit.
[2023-03-14 01:04:21] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-14 01:04:21] [INFO ] Implicit Places using invariants and state equation in 492 ms returned [37]
Discarding 1 places :
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 711 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/216 places, 372/442 transitions.
Applied a total of 0 rules in 14 ms. Remains 168 /168 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2054 ms. Remains : 168/216 places, 372/442 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:21] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
// Phase 1: matrix 368 rows 168 cols
[2023-03-14 01:04:21] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-14 01:04:21] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:22] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-14 01:04:22] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 01:04:22] [INFO ] After 33ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:22] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-14 01:04:22] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 372/372 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 168/168 places, 372/372 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 821284 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :{}
Probabilistic random walk after 821284 steps, saw 117996 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:25] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2023-03-14 01:04:25] [INFO ] Invariant cache hit.
[2023-03-14 01:04:25] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:25] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2023-03-14 01:04:25] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 01:04:25] [INFO ] After 27ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:25] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-14 01:04:25] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 168/168 places, 372/372 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 372/372 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2023-03-14 01:04:25] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2023-03-14 01:04:25] [INFO ] Invariant cache hit.
[2023-03-14 01:04:25] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-14 01:04:25] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2023-03-14 01:04:25] [INFO ] Invariant cache hit.
[2023-03-14 01:04:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 01:04:26] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2023-03-14 01:04:26] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-14 01:04:26] [INFO ] Flow matrix only has 368 transitions (discarded 4 similar events)
[2023-03-14 01:04:26] [INFO ] Invariant cache hit.
[2023-03-14 01:04:26] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1165 ms. Remains : 168/168 places, 372/372 transitions.
Graph (trivial) has 65 edges and 168 vertex of which 46 / 168 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 455 edges and 145 vertex of which 76 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.2 ms
Discarding 69 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Drop transitions removed 85 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 76 transition count 151
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 76 transition count 151
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 117 place count 76 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 75 transition count 149
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 15 edges and 71 vertex of which 4 / 71 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 69 transition count 149
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 127 place count 69 transition count 145
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 127 place count 69 transition count 144
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 68 transition count 144
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 134 place count 68 transition count 139
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 143 place count 63 transition count 135
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 63 transition count 133
Graph (complete) has 178 edges and 63 vertex of which 61 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 146 place count 61 transition count 132
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 150 place count 61 transition count 128
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 61 transition count 128
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 157 place count 59 transition count 125
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 159 place count 59 transition count 123
Applied a total of 159 rules in 52 ms. Remains 59 /168 variables (removed 109) and now considering 123/372 (removed 249) transitions.
Running SMT prover for 1 properties.
[2023-03-14 01:04:26] [INFO ] Flow matrix only has 115 transitions (discarded 8 similar events)
// Phase 1: matrix 115 rows 59 cols
[2023-03-14 01:04:26] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 01:04:26] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 01:04:27] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:27] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 01:04:27] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA NoC3x3-PT-3B-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 65 stabilizing places and 65 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' '!(F(p0))'
Support contains 1 out of 968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Graph (trivial) has 780 edges and 968 vertex of which 72 / 968 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 904 transition count 1020
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 266 place count 773 transition count 1017
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 772 transition count 1017
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 267 place count 772 transition count 939
Deduced a syphon composed of 78 places in 4 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 423 place count 694 transition count 939
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 456 place count 661 transition count 874
Iterating global reduction 3 with 33 rules applied. Total rules applied 489 place count 661 transition count 874
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 489 place count 661 transition count 873
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 491 place count 660 transition count 873
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 496 place count 655 transition count 863
Iterating global reduction 3 with 5 rules applied. Total rules applied 501 place count 655 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 502 place count 655 transition count 862
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 504 place count 653 transition count 860
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 653 transition count 860
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 508 place count 653 transition count 858
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 5 with 684 rules applied. Total rules applied 1192 place count 311 transition count 516
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1205 place count 298 transition count 493
Iterating global reduction 5 with 13 rules applied. Total rules applied 1218 place count 298 transition count 493
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1221 place count 298 transition count 490
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1225 place count 294 transition count 482
Iterating global reduction 6 with 4 rules applied. Total rules applied 1229 place count 294 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1230 place count 294 transition count 481
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1232 place count 292 transition count 477
Iterating global reduction 7 with 2 rules applied. Total rules applied 1234 place count 292 transition count 477
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1260 place count 279 transition count 476
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1267 place count 279 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1268 place count 278 transition count 475
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1277 place count 269 transition count 475
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 1325 place count 245 transition count 451
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 1349 place count 245 transition count 427
Applied a total of 1349 rules in 358 ms. Remains 245 /968 variables (removed 723) and now considering 427/1215 (removed 788) transitions.
[2023-03-14 01:04:27] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
// Phase 1: matrix 419 rows 245 cols
[2023-03-14 01:04:27] [INFO ] Computed 33 place invariants in 5 ms
[2023-03-14 01:04:28] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-14 01:04:28] [INFO ] Flow matrix only has 419 transitions (discarded 8 similar events)
[2023-03-14 01:04:28] [INFO ] Invariant cache hit.
[2023-03-14 01:04:28] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-14 01:04:28] [INFO ] Implicit Places using invariants and state equation in 450 ms returned [21, 75, 107]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 988 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/968 places, 427/1215 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 426
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 241 transition count 426
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 239 transition count 424
Applied a total of 6 rules in 21 ms. Remains 239 /242 variables (removed 3) and now considering 424/427 (removed 3) transitions.
[2023-03-14 01:04:28] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
// Phase 1: matrix 416 rows 239 cols
[2023-03-14 01:04:28] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 01:04:29] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-14 01:04:29] [INFO ] Flow matrix only has 416 transitions (discarded 8 similar events)
[2023-03-14 01:04:29] [INFO ] Invariant cache hit.
[2023-03-14 01:04:29] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-14 01:04:29] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 239/968 places, 424/1215 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2144 ms. Remains : 239/968 places, 424/1215 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s134 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 2 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-00 finished in 2426 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&&F(!p1)) U p1)))'
Support contains 3 out of 968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Graph (trivial) has 778 edges and 968 vertex of which 72 / 968 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 904 transition count 1019
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 136 rules applied. Total rules applied 269 place count 772 transition count 1015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 771 transition count 1015
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 270 place count 771 transition count 937
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 426 place count 693 transition count 937
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 458 place count 661 transition count 873
Iterating global reduction 3 with 32 rules applied. Total rules applied 490 place count 661 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 490 place count 661 transition count 872
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 492 place count 660 transition count 872
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 496 place count 656 transition count 864
Iterating global reduction 3 with 4 rules applied. Total rules applied 500 place count 656 transition count 864
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 501 place count 656 transition count 863
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 502 place count 655 transition count 862
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 655 transition count 862
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 655 transition count 861
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 5 with 678 rules applied. Total rules applied 1182 place count 316 transition count 522
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1195 place count 303 transition count 499
Iterating global reduction 5 with 13 rules applied. Total rules applied 1208 place count 303 transition count 499
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1211 place count 303 transition count 496
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1215 place count 299 transition count 488
Iterating global reduction 6 with 4 rules applied. Total rules applied 1219 place count 299 transition count 488
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1220 place count 299 transition count 487
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1222 place count 297 transition count 483
Iterating global reduction 7 with 2 rules applied. Total rules applied 1224 place count 297 transition count 483
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1252 place count 283 transition count 482
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1253 place count 283 transition count 482
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1254 place count 282 transition count 481
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1258 place count 278 transition count 481
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 1278 place count 268 transition count 471
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1288 place count 268 transition count 461
Applied a total of 1288 rules in 208 ms. Remains 268 /968 variables (removed 700) and now considering 461/1215 (removed 754) transitions.
[2023-03-14 01:04:30] [INFO ] Flow matrix only has 453 transitions (discarded 8 similar events)
// Phase 1: matrix 453 rows 268 cols
[2023-03-14 01:04:30] [INFO ] Computed 38 place invariants in 2 ms
[2023-03-14 01:04:30] [INFO ] Implicit Places using invariants in 637 ms returned [7, 31, 65, 89, 126]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 641 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 263/968 places, 461/1215 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 249 transition count 447
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 249 transition count 433
Applied a total of 42 rules in 13 ms. Remains 249 /263 variables (removed 14) and now considering 433/461 (removed 28) transitions.
[2023-03-14 01:04:30] [INFO ] Flow matrix only has 425 transitions (discarded 8 similar events)
// Phase 1: matrix 425 rows 249 cols
[2023-03-14 01:04:30] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 01:04:30] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-14 01:04:30] [INFO ] Flow matrix only has 425 transitions (discarded 8 similar events)
[2023-03-14 01:04:30] [INFO ] Invariant cache hit.
[2023-03-14 01:04:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-14 01:04:31] [INFO ] Implicit Places using invariants and state equation in 423 ms returned [22, 76, 108]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 614 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 246/968 places, 433/1215 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 246 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 245 transition count 432
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 243 transition count 430
Applied a total of 6 rules in 19 ms. Remains 243 /246 variables (removed 3) and now considering 430/433 (removed 3) transitions.
[2023-03-14 01:04:31] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
// Phase 1: matrix 422 rows 243 cols
[2023-03-14 01:04:31] [INFO ] Computed 33 place invariants in 1 ms
[2023-03-14 01:04:31] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-14 01:04:31] [INFO ] Flow matrix only has 422 transitions (discarded 8 similar events)
[2023-03-14 01:04:31] [INFO ] Invariant cache hit.
[2023-03-14 01:04:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-14 01:04:32] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 243/968 places, 430/1215 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2163 ms. Remains : 243/968 places, 430/1215 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s150 1) (EQ s178 1)), p0:(NEQ s159 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 NoC3x3-PT-3B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-01 finished in 2321 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))||(F(!p0)&&G(!p1)))))'
Support contains 4 out of 968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Graph (trivial) has 779 edges and 968 vertex of which 72 / 968 are part of one of the 9 SCC in 1 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 133 place count 904 transition count 1019
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 136 rules applied. Total rules applied 269 place count 772 transition count 1015
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 771 transition count 1015
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 270 place count 771 transition count 937
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 426 place count 693 transition count 937
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 458 place count 661 transition count 873
Iterating global reduction 3 with 32 rules applied. Total rules applied 490 place count 661 transition count 873
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 490 place count 661 transition count 872
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 492 place count 660 transition count 872
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 495 place count 657 transition count 865
Iterating global reduction 3 with 3 rules applied. Total rules applied 498 place count 657 transition count 865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 499 place count 657 transition count 864
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 500 place count 656 transition count 863
Iterating global reduction 4 with 1 rules applied. Total rules applied 501 place count 656 transition count 863
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 502 place count 656 transition count 862
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 5 with 678 rules applied. Total rules applied 1180 place count 317 transition count 523
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 1193 place count 304 transition count 500
Iterating global reduction 5 with 13 rules applied. Total rules applied 1206 place count 304 transition count 500
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1209 place count 304 transition count 497
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1213 place count 300 transition count 489
Iterating global reduction 6 with 4 rules applied. Total rules applied 1217 place count 300 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1218 place count 300 transition count 488
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1220 place count 298 transition count 484
Iterating global reduction 7 with 2 rules applied. Total rules applied 1222 place count 298 transition count 484
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 1250 place count 284 transition count 483
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1252 place count 284 transition count 483
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1253 place count 283 transition count 482
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1258 place count 278 transition count 482
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1286 place count 264 transition count 468
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1300 place count 264 transition count 454
Applied a total of 1300 rules in 201 ms. Remains 264 /968 variables (removed 704) and now considering 454/1215 (removed 761) transitions.
[2023-03-14 01:04:32] [INFO ] Flow matrix only has 446 transitions (discarded 8 similar events)
// Phase 1: matrix 446 rows 264 cols
[2023-03-14 01:04:32] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-14 01:04:32] [INFO ] Implicit Places using invariants in 217 ms returned [7, 31, 67, 91]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 223 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 260/968 places, 454/1215 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 250 transition count 444
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 30 place count 250 transition count 434
Applied a total of 30 rules in 15 ms. Remains 250 /260 variables (removed 10) and now considering 434/454 (removed 20) transitions.
[2023-03-14 01:04:32] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
// Phase 1: matrix 426 rows 250 cols
[2023-03-14 01:04:32] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 01:04:32] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-14 01:04:32] [INFO ] Flow matrix only has 426 transitions (discarded 8 similar events)
[2023-03-14 01:04:32] [INFO ] Invariant cache hit.
[2023-03-14 01:04:33] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:04:33] [INFO ] Implicit Places using invariants and state equation in 491 ms returned [78, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 725 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 248/968 places, 434/1215 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 248 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 247 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 246 transition count 432
Applied a total of 4 rules in 14 ms. Remains 246 /248 variables (removed 2) and now considering 432/434 (removed 2) transitions.
[2023-03-14 01:04:33] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 246 cols
[2023-03-14 01:04:33] [INFO ] Computed 33 place invariants in 7 ms
[2023-03-14 01:04:33] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-14 01:04:33] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:04:33] [INFO ] Invariant cache hit.
[2023-03-14 01:04:33] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:04:34] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 246/968 places, 432/1215 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1997 ms. Remains : 246/968 places, 432/1215 transitions.
Stuttering acceptance computed with spot in 150 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s22 1) (EQ s44 1)), p0:(AND (EQ s108 1) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1235 reset in 944 ms.
Product exploration explored 100000 steps with 1232 reset in 633 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[p0, (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 131 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:36] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:04:36] [INFO ] Invariant cache hit.
[2023-03-14 01:04:36] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-14 01:04:36] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-14 01:04:37] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:37] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:04:37] [INFO ] After 37ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:37] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-14 01:04:37] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 432/432 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 246 transition count 423
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 244 transition count 434
Free-agglomeration rule applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 40 place count 244 transition count 407
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 73 place count 217 transition count 401
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 111 place count 217 transition count 371
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 166 place count 175 transition count 358
Applied a total of 166 rules in 27 ms. Remains 175 /246 variables (removed 71) and now considering 358/432 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 175/246 places, 358/432 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 951286 steps, run timeout after 3001 ms. (steps per millisecond=316 ) properties seen :{}
Probabilistic random walk after 951286 steps, saw 129757 distinct states, run finished after 3001 ms. (steps per millisecond=316 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:40] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
// Phase 1: matrix 356 rows 175 cols
[2023-03-14 01:04:40] [INFO ] Computed 29 place invariants in 8 ms
[2023-03-14 01:04:40] [INFO ] [Real]Absence check using 29 positive place invariants in 8 ms returned sat
[2023-03-14 01:04:40] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:40] [INFO ] [Nat]Absence check using 29 positive place invariants in 7 ms returned sat
[2023-03-14 01:04:40] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-14 01:04:40] [INFO ] After 40ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:40] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-14 01:04:40] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 358/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 175/175 places, 358/358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 358/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2023-03-14 01:04:40] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
[2023-03-14 01:04:40] [INFO ] Invariant cache hit.
[2023-03-14 01:04:41] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-14 01:04:41] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
[2023-03-14 01:04:41] [INFO ] Invariant cache hit.
[2023-03-14 01:04:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-14 01:04:41] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [77]
Discarding 1 places :
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 760 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 174/175 places, 356/358 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 770 ms. Remains : 174/175 places, 356/358 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 863478 steps, run timeout after 3001 ms. (steps per millisecond=287 ) properties seen :{}
Probabilistic random walk after 863478 steps, saw 114413 distinct states, run finished after 3001 ms. (steps per millisecond=287 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:44] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
// Phase 1: matrix 354 rows 174 cols
[2023-03-14 01:04:44] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-14 01:04:44] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2023-03-14 01:04:44] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:44] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2023-03-14 01:04:45] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 01:04:45] [INFO ] After 30ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:45] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-14 01:04:45] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 174/174 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 3 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-14 01:04:45] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:45] [INFO ] Invariant cache hit.
[2023-03-14 01:04:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-14 01:04:45] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:45] [INFO ] Invariant cache hit.
[2023-03-14 01:04:45] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 01:04:45] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-14 01:04:46] [INFO ] Redundant transitions in 148 ms returned []
[2023-03-14 01:04:46] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:46] [INFO ] Invariant cache hit.
[2023-03-14 01:04:46] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1567 ms. Remains : 174/174 places, 356/356 transitions.
Graph (trivial) has 64 edges and 174 vertex of which 44 / 174 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 453 edges and 152 vertex of which 103 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.0 ms
Discarding 49 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Drop transitions removed 69 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 103 transition count 198
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 28 edges and 100 vertex of which 6 / 100 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 97 transition count 198
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 97 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 96 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 96 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 96 transition count 189
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 96 transition count 186
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 100 place count 96 transition count 178
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t598.t1091.t552.t1096 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 108 place count 86 transition count 170
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t153.t1202.t110.t1203.t112 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 114 place count 83 transition count 163
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 83 transition count 163
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 127 place count 80 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 129 place count 79 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 137 place count 79 transition count 154
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 138 place count 79 transition count 153
Applied a total of 138 rules in 22 ms. Remains 79 /174 variables (removed 95) and now considering 153/356 (removed 203) transitions.
Running SMT prover for 1 properties.
[2023-03-14 01:04:46] [INFO ] Flow matrix only has 151 transitions (discarded 2 similar events)
// Phase 1: matrix 151 rows 79 cols
[2023-03-14 01:04:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-14 01:04:46] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-14 01:04:46] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-14 01:04:47] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:47] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-14 01:04:47] [INFO ] After 15ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:47] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-14 01:04:47] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 110 ms :[p0, (AND p1 p0), p0]
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 432/432 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-03-14 01:04:47] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 246 cols
[2023-03-14 01:04:47] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 01:04:47] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-14 01:04:47] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:04:47] [INFO ] Invariant cache hit.
[2023-03-14 01:04:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:04:48] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2023-03-14 01:04:48] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 01:04:48] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:04:48] [INFO ] Invariant cache hit.
[2023-03-14 01:04:48] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1289 ms. Remains : 246/246 places, 432/432 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[p0, (AND p1 p0), p0]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:49] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:04:49] [INFO ] Invariant cache hit.
[2023-03-14 01:04:49] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-14 01:04:49] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-14 01:04:50] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:04:50] [INFO ] After 27ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:50] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-14 01:04:50] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 432/432 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 246 transition count 423
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 244 transition count 434
Free-agglomeration rule applied 27 times.
Iterating global reduction 1 with 27 rules applied. Total rules applied 40 place count 244 transition count 407
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 73 place count 217 transition count 401
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 2 with 38 rules applied. Total rules applied 111 place count 217 transition count 371
Reduce places removed 42 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 55 rules applied. Total rules applied 166 place count 175 transition count 358
Applied a total of 166 rules in 33 ms. Remains 175 /246 variables (removed 71) and now considering 358/432 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 175/246 places, 358/432 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 898564 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898564 steps, saw 121239 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:53] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
// Phase 1: matrix 356 rows 175 cols
[2023-03-14 01:04:53] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-14 01:04:53] [INFO ] [Real]Absence check using 29 positive place invariants in 8 ms returned sat
[2023-03-14 01:04:53] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:53] [INFO ] [Nat]Absence check using 29 positive place invariants in 8 ms returned sat
[2023-03-14 01:04:53] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-14 01:04:53] [INFO ] After 30ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:53] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-14 01:04:53] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 358/358 transitions.
Applied a total of 0 rules in 6 ms. Remains 175 /175 variables (removed 0) and now considering 358/358 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 175/175 places, 358/358 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 358/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 175 /175 variables (removed 0) and now considering 358/358 (removed 0) transitions.
[2023-03-14 01:04:53] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
[2023-03-14 01:04:53] [INFO ] Invariant cache hit.
[2023-03-14 01:04:54] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-14 01:04:54] [INFO ] Flow matrix only has 356 transitions (discarded 2 similar events)
[2023-03-14 01:04:54] [INFO ] Invariant cache hit.
[2023-03-14 01:04:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-14 01:04:54] [INFO ] Implicit Places using invariants and state equation in 434 ms returned [77]
Discarding 1 places :
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT with State Equation took 629 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 174/175 places, 356/358 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 640 ms. Remains : 174/175 places, 356/358 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 928889 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :{}
Probabilistic random walk after 928889 steps, saw 122538 distinct states, run finished after 3001 ms. (steps per millisecond=309 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 01:04:57] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
// Phase 1: matrix 354 rows 174 cols
[2023-03-14 01:04:57] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-14 01:04:57] [INFO ] [Real]Absence check using 28 positive place invariants in 8 ms returned sat
[2023-03-14 01:04:57] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:57] [INFO ] [Nat]Absence check using 28 positive place invariants in 9 ms returned sat
[2023-03-14 01:04:58] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 01:04:58] [INFO ] After 30ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:58] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-14 01:04:58] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 174/174 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 356/356 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2023-03-14 01:04:58] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:58] [INFO ] Invariant cache hit.
[2023-03-14 01:04:58] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-14 01:04:58] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:58] [INFO ] Invariant cache hit.
[2023-03-14 01:04:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-14 01:04:58] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2023-03-14 01:04:58] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-14 01:04:58] [INFO ] Flow matrix only has 354 transitions (discarded 2 similar events)
[2023-03-14 01:04:58] [INFO ] Invariant cache hit.
[2023-03-14 01:04:59] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 174/174 places, 356/356 transitions.
Graph (trivial) has 64 edges and 174 vertex of which 44 / 174 are part of one of the 22 SCC in 0 ms
Free SCC test removed 22 places
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 453 edges and 152 vertex of which 103 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 34 output transitions
Drop transitions removed 34 transitions
Drop transitions removed 69 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 103 transition count 198
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 28 edges and 100 vertex of which 6 / 100 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 97 transition count 198
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 97 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 96 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 96 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 96 transition count 189
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 92 place count 96 transition count 186
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 100 place count 96 transition count 178
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t598.t1091.t552.t1096 and 2 places that fell out of Prefix Of Interest.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 108 place count 86 transition count 170
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Remove reverse transitions (loop back) rule discarded transition t153.t1202.t110.t1203.t112 and 3 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 114 place count 83 transition count 163
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 116 place count 83 transition count 163
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 11 rules applied. Total rules applied 127 place count 80 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 129 place count 79 transition count 154
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 137 place count 79 transition count 154
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 138 place count 79 transition count 153
Applied a total of 138 rules in 20 ms. Remains 79 /174 variables (removed 95) and now considering 153/356 (removed 203) transitions.
Running SMT prover for 1 properties.
[2023-03-14 01:04:59] [INFO ] Flow matrix only has 151 transitions (discarded 2 similar events)
// Phase 1: matrix 151 rows 79 cols
[2023-03-14 01:04:59] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-14 01:04:59] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-14 01:04:59] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 01:04:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-14 01:04:59] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:59] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-14 01:04:59] [INFO ] After 19ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 01:04:59] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-14 01:04:59] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 7 factoid took 457 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 132 ms :[p0, (AND p1 p0), p0]
Stuttering acceptance computed with spot in 124 ms :[p0, (AND p1 p0), p0]
Product exploration explored 100000 steps with 1236 reset in 652 ms.
Product exploration explored 100000 steps with 1231 reset in 537 ms.
Support contains 4 out of 246 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 246/246 places, 432/432 transitions.
Applied a total of 0 rules in 5 ms. Remains 246 /246 variables (removed 0) and now considering 432/432 (removed 0) transitions.
[2023-03-14 01:05:01] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
// Phase 1: matrix 424 rows 246 cols
[2023-03-14 01:05:01] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-14 01:05:01] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-14 01:05:01] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:05:01] [INFO ] Invariant cache hit.
[2023-03-14 01:05:01] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-14 01:05:02] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-14 01:05:02] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 01:05:02] [INFO ] Flow matrix only has 424 transitions (discarded 8 similar events)
[2023-03-14 01:05:02] [INFO ] Invariant cache hit.
[2023-03-14 01:05:02] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1104 ms. Remains : 246/246 places, 432/432 transitions.
Treatment of property NoC3x3-PT-3B-LTLFireability-02 finished in 30559 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((F(p0)&&G(p1)))))'
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 953 transition count 1199
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 953 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 953 transition count 1196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 948 transition count 1189
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 948 transition count 1189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 941 transition count 1181
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 941 transition count 1181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 941 transition count 1180
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 938 transition count 1177
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 938 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 938 transition count 1174
Applied a total of 67 rules in 188 ms. Remains 938 /968 variables (removed 30) and now considering 1174/1215 (removed 41) transitions.
// Phase 1: matrix 1174 rows 938 cols
[2023-03-14 01:05:03] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-14 01:05:03] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-14 01:05:03] [INFO ] Invariant cache hit.
[2023-03-14 01:05:04] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned [137, 316, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1958 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 935/968 places, 1174/1215 transitions.
Applied a total of 0 rules in 30 ms. Remains 935 /935 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2177 ms. Remains : 935/968 places, 1174/1215 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s607 1), p0:(EQ s470 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 624 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-04 finished in 2369 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)))'
Support contains 4 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 954 transition count 1200
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 954 transition count 1200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 954 transition count 1197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 949 transition count 1189
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 949 transition count 1189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 942 transition count 1182
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 942 transition count 1182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 942 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 939 transition count 1177
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 939 transition count 1177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 939 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 938 transition count 1174
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 938 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 937 transition count 1173
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 937 transition count 1173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 937 transition count 1172
Applied a total of 69 rules in 266 ms. Remains 937 /968 variables (removed 31) and now considering 1172/1215 (removed 43) transitions.
// Phase 1: matrix 1172 rows 937 cols
[2023-03-14 01:05:05] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-14 01:05:05] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-14 01:05:06] [INFO ] Invariant cache hit.
[2023-03-14 01:05:07] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned [137, 316, 425]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1963 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 934/968 places, 1172/1215 transitions.
Applied a total of 0 rules in 31 ms. Remains 934 /934 variables (removed 0) and now considering 1172/1172 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2262 ms. Remains : 934/968 places, 1172/1215 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s831 0) (EQ s317 1) (OR (EQ s600 0) (EQ s911 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-06 finished in 2377 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((F(!p0) U p1)) U (G(p3)&&p2)))))'
Support contains 6 out of 968 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Graph (trivial) has 769 edges and 968 vertex of which 72 / 968 are part of one of the 9 SCC in 2 ms
Free SCC test removed 63 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 904 transition count 1021
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 134 rules applied. Total rules applied 265 place count 774 transition count 1017
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 268 place count 773 transition count 1015
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 270 place count 771 transition count 1015
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 270 place count 771 transition count 939
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 422 place count 695 transition count 939
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 453 place count 664 transition count 876
Iterating global reduction 4 with 31 rules applied. Total rules applied 484 place count 664 transition count 876
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 484 place count 664 transition count 875
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 486 place count 663 transition count 875
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 491 place count 658 transition count 865
Iterating global reduction 4 with 5 rules applied. Total rules applied 496 place count 658 transition count 865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 497 place count 658 transition count 864
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 499 place count 656 transition count 862
Iterating global reduction 5 with 2 rules applied. Total rules applied 501 place count 656 transition count 862
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 503 place count 656 transition count 860
Performed 336 Post agglomeration using F-continuation condition.Transition count delta: 336
Deduced a syphon composed of 336 places in 0 ms
Reduce places removed 336 places and 0 transitions.
Iterating global reduction 6 with 672 rules applied. Total rules applied 1175 place count 320 transition count 524
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1188 place count 307 transition count 501
Iterating global reduction 6 with 13 rules applied. Total rules applied 1201 place count 307 transition count 501
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1204 place count 307 transition count 498
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1208 place count 303 transition count 490
Iterating global reduction 7 with 4 rules applied. Total rules applied 1212 place count 303 transition count 490
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1213 place count 303 transition count 489
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1215 place count 301 transition count 485
Iterating global reduction 8 with 2 rules applied. Total rules applied 1217 place count 301 transition count 485
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 8 with 28 rules applied. Total rules applied 1245 place count 287 transition count 484
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1249 place count 287 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1250 place count 286 transition count 483
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 1257 place count 280 transition count 482
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1259 place count 279 transition count 481
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 10 with 30 rules applied. Total rules applied 1289 place count 264 transition count 466
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 15 rules applied. Total rules applied 1304 place count 264 transition count 451
Applied a total of 1304 rules in 152 ms. Remains 264 /968 variables (removed 704) and now considering 451/1215 (removed 764) transitions.
[2023-03-14 01:05:07] [INFO ] Flow matrix only has 443 transitions (discarded 8 similar events)
// Phase 1: matrix 443 rows 264 cols
[2023-03-14 01:05:07] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-14 01:05:08] [INFO ] Implicit Places using invariants in 310 ms returned [8, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 313 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 262/968 places, 451/1215 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 257 transition count 446
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 15 place count 257 transition count 441
Applied a total of 15 rules in 9 ms. Remains 257 /262 variables (removed 5) and now considering 441/451 (removed 10) transitions.
[2023-03-14 01:05:08] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
// Phase 1: matrix 433 rows 257 cols
[2023-03-14 01:05:08] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-14 01:05:08] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-14 01:05:08] [INFO ] Flow matrix only has 433 transitions (discarded 8 similar events)
[2023-03-14 01:05:08] [INFO ] Invariant cache hit.
[2023-03-14 01:05:08] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-14 01:05:08] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [24, 85, 117]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 627 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/968 places, 441/1215 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 254 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 253 transition count 440
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 251 transition count 438
Applied a total of 6 rules in 10 ms. Remains 251 /254 variables (removed 3) and now considering 438/441 (removed 3) transitions.
[2023-03-14 01:05:08] [INFO ] Flow matrix only has 430 transitions (discarded 8 similar events)
// Phase 1: matrix 430 rows 251 cols
[2023-03-14 01:05:08] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 01:05:08] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-14 01:05:08] [INFO ] Flow matrix only has 430 transitions (discarded 8 similar events)
[2023-03-14 01:05:08] [INFO ] Invariant cache hit.
[2023-03-14 01:05:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-14 01:05:09] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 251/968 places, 438/1215 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1854 ms. Remains : 251/968 places, 438/1215 transitions.
Stuttering acceptance computed with spot in 1232 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p3), (AND p0 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 p3), acceptance={} source=0 dest: 6}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=0 dest: 7}], [{ cond=(AND p2 p3 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={1, 2} source=1 dest: 5}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=2 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p2) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p3), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND p2 p3 p0) (AND p1 p0)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1, 2} source=4 dest: 4}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={1, 2} source=4 dest: 7}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={0, 2} source=4 dest: 8}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={0, 1, 2} source=4 dest: 9}, { cond=(AND p2 p3 p1 p0), acceptance={1, 2} source=4 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(NOT p3), acceptance={} source=6 dest: 2}, { cond=(NOT p3), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={1, 2} source=6 dest: 6}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) p1 p0), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1, 2} source=7 dest: 4}, { cond=(AND p3 p1 p0), acceptance={1} source=7 dest: 7}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=7 dest: 7}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 2} source=7 dest: 8}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 1, 2} source=7 dest: 9}, { cond=(AND p3 p1 p0), acceptance={1, 2} source=7 dest: 11}], [{ cond=(AND p2 p3 (NOT p1) p0), acceptance={0, 1} source=8 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1, 2} source=8 dest: 4}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={1, 2} source=8 dest: 7}, { cond=(AND p2 p3 p1 p0), acceptance={0} source=8 dest: 8}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={0, 2} source=8 dest: 8}, { cond=(AND p2 p3 p1 p0), acceptance={2} source=8 dest: 10}], [{ cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1, 2} source=9 dest: 4}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={1, 2} source=9 dest: 7}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={0, 2} source=9 dest: 8}, { cond=(OR (AND (NOT p2) p1 p0) (AND (NOT p3) p1 p0)), acceptance={0, 1, 2} source=9 dest: 9}, { cond=(AND p2 p3 p1 p0), acceptance={1, 2} source=9 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1, 2} source=10 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=10 dest: 7}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 2} source=10 dest: 8}, { cond=(AND p3 p1 p0), acceptance={2} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1, 2} source=11 dest: 4}, { cond=(AND p3 (NOT p1) p0), acceptance={1, 2} source=11 dest: 7}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 2} source=11 dest: 8}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 1, 2} source=11 dest: 9}, { cond=(AND p3 p1 p0), acceptance={1, 2} source=11 dest: 11}]], initial=0, aps=[p2:(AND (EQ s19 1) (EQ s51 1)), p1:(EQ s145 1), p3:(NEQ s137 1), p0:(AND (EQ s60 1) (EQ s70 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-07 finished in 3139 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)||F(p1))))'
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 953 transition count 1199
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 953 transition count 1199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 953 transition count 1197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 948 transition count 1189
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 948 transition count 1189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 943 transition count 1183
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 943 transition count 1183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 943 transition count 1182
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 939 transition count 1177
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 939 transition count 1177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 939 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 938 transition count 1173
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 938 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 937 transition count 1172
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 937 transition count 1172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 937 transition count 1171
Applied a total of 69 rules in 168 ms. Remains 937 /968 variables (removed 31) and now considering 1171/1215 (removed 44) transitions.
// Phase 1: matrix 1171 rows 937 cols
[2023-03-14 01:05:10] [INFO ] Computed 42 place invariants in 4 ms
[2023-03-14 01:05:11] [INFO ] Implicit Places using invariants in 435 ms returned []
[2023-03-14 01:05:11] [INFO ] Invariant cache hit.
[2023-03-14 01:05:12] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned [137, 321, 429]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1739 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 934/968 places, 1171/1215 transitions.
Applied a total of 0 rules in 21 ms. Remains 934 /934 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1930 ms. Remains : 934/968 places, 1171/1215 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, 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 s545 1), p0:(EQ s204 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][false, false, false]]
Stuttering criterion allowed to conclude after 680 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-08 finished in 2065 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))&&F(p1)))'
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 952 transition count 1199
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 952 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 952 transition count 1196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 947 transition count 1188
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 947 transition count 1188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 940 transition count 1180
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 940 transition count 1180
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 936 transition count 1175
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 936 transition count 1175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 70 place count 936 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 935 transition count 1171
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 935 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 934 transition count 1170
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 934 transition count 1170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 934 transition count 1169
Applied a total of 75 rules in 268 ms. Remains 934 /968 variables (removed 34) and now considering 1169/1215 (removed 46) transitions.
// Phase 1: matrix 1169 rows 934 cols
[2023-03-14 01:05:13] [INFO ] Computed 42 place invariants in 6 ms
[2023-03-14 01:05:13] [INFO ] Implicit Places using invariants in 518 ms returned []
[2023-03-14 01:05:13] [INFO ] Invariant cache hit.
[2023-03-14 01:05:15] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned [137, 316, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1959 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 931/968 places, 1169/1215 transitions.
Applied a total of 0 rules in 22 ms. Remains 931 /931 variables (removed 0) and now considering 1169/1169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2250 ms. Remains : 931/968 places, 1169/1215 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s301 1), p1:(EQ s687 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-09 finished in 2417 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(X(X(G(p0)))))'
Support contains 1 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 951 transition count 1197
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 951 transition count 1197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 951 transition count 1194
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 945 transition count 1185
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 945 transition count 1185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 937 transition count 1176
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 937 transition count 1176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 937 transition count 1175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 933 transition count 1170
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 933 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 933 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 932 transition count 1166
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 932 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 931 transition count 1165
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 931 transition count 1165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 931 transition count 1164
Applied a total of 82 rules in 239 ms. Remains 931 /968 variables (removed 37) and now considering 1164/1215 (removed 51) transitions.
// Phase 1: matrix 1164 rows 931 cols
[2023-03-14 01:05:15] [INFO ] Computed 42 place invariants in 6 ms
[2023-03-14 01:05:15] [INFO ] Implicit Places using invariants in 444 ms returned []
[2023-03-14 01:05:15] [INFO ] Invariant cache hit.
[2023-03-14 01:05:17] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned [137, 316, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1827 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/968 places, 1164/1215 transitions.
Applied a total of 0 rules in 36 ms. Remains 928 /928 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2103 ms. Remains : 928/968 places, 1164/1215 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-11 finished in 2304 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)))'
Support contains 2 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 951 transition count 1197
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 951 transition count 1197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 951 transition count 1194
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 945 transition count 1185
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 945 transition count 1185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 937 transition count 1176
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 937 transition count 1176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 937 transition count 1175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 933 transition count 1170
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 933 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 933 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 932 transition count 1166
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 932 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 931 transition count 1165
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 931 transition count 1165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 931 transition count 1164
Applied a total of 82 rules in 160 ms. Remains 931 /968 variables (removed 37) and now considering 1164/1215 (removed 51) transitions.
[2023-03-14 01:05:17] [INFO ] Invariant cache hit.
[2023-03-14 01:05:18] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-14 01:05:18] [INFO ] Invariant cache hit.
[2023-03-14 01:05:19] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned [137, 424]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1712 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 929/968 places, 1164/1215 transitions.
Applied a total of 0 rules in 21 ms. Remains 929 /929 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1895 ms. Remains : 929/968 places, 1164/1215 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s315 1) (EQ s325 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][false, false]]
Stuttering criterion allowed to conclude after 730 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-13 finished in 1999 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((F(p1)&&p0))))'
Support contains 4 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 953 transition count 1199
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 953 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 953 transition count 1196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 947 transition count 1187
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 947 transition count 1187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 939 transition count 1178
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 939 transition count 1178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 939 transition count 1177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 935 transition count 1172
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 935 transition count 1172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 935 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 934 transition count 1168
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 934 transition count 1168
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 933 transition count 1167
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 933 transition count 1167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 933 transition count 1166
Applied a total of 78 rules in 167 ms. Remains 933 /968 variables (removed 35) and now considering 1166/1215 (removed 49) transitions.
// Phase 1: matrix 1166 rows 933 cols
[2023-03-14 01:05:19] [INFO ] Computed 42 place invariants in 5 ms
[2023-03-14 01:05:20] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-14 01:05:20] [INFO ] Invariant cache hit.
[2023-03-14 01:05:21] [INFO ] Implicit Places using invariants and state equation in 1148 ms returned [137, 316, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1601 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 930/968 places, 1166/1215 transitions.
Applied a total of 0 rules in 21 ms. Remains 930 /930 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1790 ms. Remains : 930/968 places, 1166/1215 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s279 1) (EQ s593 1)), p0:(AND (EQ s515 1) (EQ s597 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][false, false, false]]
Stuttering criterion allowed to conclude after 575 steps with 0 reset in 11 ms.
FORMULA NoC3x3-PT-3B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3B-LTLFireability-14 finished in 1926 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(G(p1))||p0)))'
Support contains 3 out of 968 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 968/968 places, 1215/1215 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 951 transition count 1197
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 951 transition count 1197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 951 transition count 1194
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 945 transition count 1185
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 945 transition count 1185
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 937 transition count 1176
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 937 transition count 1176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 937 transition count 1175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 70 place count 933 transition count 1170
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 933 transition count 1170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 933 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 932 transition count 1166
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 932 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 931 transition count 1165
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 931 transition count 1165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 931 transition count 1164
Applied a total of 82 rules in 158 ms. Remains 931 /968 variables (removed 37) and now considering 1164/1215 (removed 51) transitions.
// Phase 1: matrix 1164 rows 931 cols
[2023-03-14 01:05:21] [INFO ] Computed 42 place invariants in 4 ms
[2023-03-14 01:05:22] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-14 01:05:22] [INFO ] Invariant cache hit.
[2023-03-14 01:05:23] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned [137, 316, 424]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 1713 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 928/968 places, 1164/1215 transitions.
Applied a total of 0 rules in 33 ms. Remains 928 /928 variables (removed 0) and now considering 1164/1164 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1905 ms. Remains : 928/968 places, 1164/1215 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s314 0) (EQ s351 0) (EQ s277 0)), p1:(OR (EQ s314 0) (EQ s351 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1255 ms.
Product exploration explored 100000 steps with 50000 reset in 1164 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-3B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-3B-LTLFireability-15 finished in 4554 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))||(F(!p0)&&G(!p1)))))'
[2023-03-14 01:05:26] [INFO ] Flatten gal took : 60 ms
[2023-03-14 01:05:26] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 01:05:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 968 places, 1215 transitions and 3028 arcs took 10 ms.
Total runtime 82469 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-3B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678756012902

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-3B-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 NoC3x3-PT-3B-LTLFireability-02 287178 m, 57435 m/sec, 653858 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 4/32 NoC3x3-PT-3B-LTLFireability-02 539251 m, 50414 m/sec, 1345775 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 6/32 NoC3x3-PT-3B-LTLFireability-02 794596 m, 51069 m/sec, 2041826 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 8/32 NoC3x3-PT-3B-LTLFireability-02 1082000 m, 57480 m/sec, 2765374 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 10/32 NoC3x3-PT-3B-LTLFireability-02 1360367 m, 55673 m/sec, 3471784 t fired, .

Time elapsed: 25 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 12/32 NoC3x3-PT-3B-LTLFireability-02 1632176 m, 54361 m/sec, 4214058 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 13/32 NoC3x3-PT-3B-LTLFireability-02 1905421 m, 54649 m/sec, 4945845 t fired, .

Time elapsed: 35 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 15/32 NoC3x3-PT-3B-LTLFireability-02 2201021 m, 59120 m/sec, 5657853 t fired, .

Time elapsed: 40 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 17/32 NoC3x3-PT-3B-LTLFireability-02 2474308 m, 54657 m/sec, 6403697 t fired, .

Time elapsed: 45 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 19/32 NoC3x3-PT-3B-LTLFireability-02 2746780 m, 54494 m/sec, 7162933 t fired, .

Time elapsed: 50 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 21/32 NoC3x3-PT-3B-LTLFireability-02 3055726 m, 61789 m/sec, 7883956 t fired, .

Time elapsed: 55 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 23/32 NoC3x3-PT-3B-LTLFireability-02 3326442 m, 54143 m/sec, 8623275 t fired, .

Time elapsed: 60 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 25/32 NoC3x3-PT-3B-LTLFireability-02 3604282 m, 55568 m/sec, 9386032 t fired, .

Time elapsed: 65 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 27/32 NoC3x3-PT-3B-LTLFireability-02 3907274 m, 60598 m/sec, 10119462 t fired, .

Time elapsed: 70 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 29/32 NoC3x3-PT-3B-LTLFireability-02 4182622 m, 55069 m/sec, 10847584 t fired, .

Time elapsed: 75 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 31/32 NoC3x3-PT-3B-LTLFireability-02 4461527 m, 55781 m/sec, 11611004 t fired, .

Time elapsed: 80 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for NoC3x3-PT-3B-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-3B-LTLFireability-02: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-3B-LTLFireability-02: LTL unknown AGGR


Time elapsed: 85 secs. Pages in use: 32

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="NoC3x3-PT-3B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is NoC3x3-PT-3B, 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 r263-smll-167863538000268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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