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-167863538100316.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-6B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 09:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 09:47 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.7K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 09:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 552K 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-6B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678765470621

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-6B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 03:44:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 03:44:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 03:44:35] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2023-03-14 03:44:35] [INFO ] Transformed 1544 places.
[2023-03-14 03:44:35] [INFO ] Transformed 2229 transitions.
[2023-03-14 03:44:35] [INFO ] Found NUPN structural information;
[2023-03-14 03:44:35] [INFO ] Parsed PT model containing 1544 places and 2229 transitions and 6663 arcs in 599 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 2 formulas.
FORMULA NoC3x3-PT-6B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 362 places :
Symmetric choice reduction at 0 with 362 rule applications. Total rules 362 place count 1182 transition count 1867
Iterating global reduction 0 with 362 rules applied. Total rules applied 724 place count 1182 transition count 1867
Discarding 109 places :
Symmetric choice reduction at 0 with 109 rule applications. Total rules 833 place count 1073 transition count 1658
Iterating global reduction 0 with 109 rules applied. Total rules applied 942 place count 1073 transition count 1658
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 1028 place count 987 transition count 1522
Iterating global reduction 0 with 86 rules applied. Total rules applied 1114 place count 987 transition count 1522
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1134 place count 967 transition count 1482
Iterating global reduction 0 with 20 rules applied. Total rules applied 1154 place count 967 transition count 1482
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1167 place count 954 transition count 1456
Iterating global reduction 0 with 13 rules applied. Total rules applied 1180 place count 954 transition count 1456
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 1193 place count 941 transition count 1443
Iterating global reduction 0 with 13 rules applied. Total rules applied 1206 place count 941 transition count 1443
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1209 place count 938 transition count 1437
Iterating global reduction 0 with 3 rules applied. Total rules applied 1212 place count 938 transition count 1437
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1215 place count 935 transition count 1431
Iterating global reduction 0 with 3 rules applied. Total rules applied 1218 place count 935 transition count 1431
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 1221 place count 932 transition count 1428
Iterating global reduction 0 with 3 rules applied. Total rules applied 1224 place count 932 transition count 1428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1230 place count 932 transition count 1422
Applied a total of 1230 rules in 925 ms. Remains 932 /1544 variables (removed 612) and now considering 1422/2229 (removed 807) transitions.
// Phase 1: matrix 1422 rows 932 cols
[2023-03-14 03:44:36] [INFO ] Computed 66 place invariants in 47 ms
[2023-03-14 03:44:37] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2023-03-14 03:44:37] [INFO ] Invariant cache hit.
[2023-03-14 03:44:39] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
[2023-03-14 03:44:39] [INFO ] Invariant cache hit.
[2023-03-14 03:44:41] [INFO ] Dead Transitions using invariants and state equation in 1494 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 932/1544 places, 1422/2229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5785 ms. Remains : 932/1544 places, 1422/2229 transitions.
Support contains 50 out of 932 places after structural reductions.
[2023-03-14 03:44:41] [INFO ] Flatten gal took : 197 ms
[2023-03-14 03:44:41] [INFO ] Flatten gal took : 155 ms
[2023-03-14 03:44:42] [INFO ] Input system was already deterministic with 1422 transitions.
Support contains 48 out of 932 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 839 ms. (steps per millisecond=11 ) properties (out of 29) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 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 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-14 03:44:43] [INFO ] Invariant cache hit.
[2023-03-14 03:44:43] [INFO ] [Real]Absence check using 66 positive place invariants in 71 ms returned sat
[2023-03-14 03:44:44] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-14 03:44:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 78 ms returned sat
[2023-03-14 03:44:45] [INFO ] After 1173ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-14 03:44:46] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 5 ms to minimize.
[2023-03-14 03:44:46] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 2 ms to minimize.
[2023-03-14 03:44:46] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 2 ms to minimize.
[2023-03-14 03:44:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 743 ms
[2023-03-14 03:44:47] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 2 ms to minimize.
[2023-03-14 03:44:47] [INFO ] Deduced a trap composed of 57 places in 441 ms of which 3 ms to minimize.
[2023-03-14 03:44:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1043 ms
[2023-03-14 03:44:48] [INFO ] Deduced a trap composed of 65 places in 481 ms of which 1 ms to minimize.
[2023-03-14 03:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 595 ms
[2023-03-14 03:44:48] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
[2023-03-14 03:44:48] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 1 ms to minimize.
[2023-03-14 03:44:48] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2023-03-14 03:44:49] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2023-03-14 03:44:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 604 ms
[2023-03-14 03:44:49] [INFO ] After 4526ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-14 03:44:49] [INFO ] After 5533ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 117 ms.
Support contains 7 out of 932 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 932 transition count 1389
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 899 transition count 1389
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 66 place count 899 transition count 1293
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 258 place count 803 transition count 1293
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 289 place count 772 transition count 1139
Iterating global reduction 2 with 31 rules applied. Total rules applied 320 place count 772 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 326 place count 766 transition count 1120
Iterating global reduction 2 with 6 rules applied. Total rules applied 332 place count 766 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 333 place count 765 transition count 1118
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 765 transition count 1118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 335 place count 764 transition count 1116
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 764 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 764 transition count 1115
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 695 place count 585 transition count 936
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 897 place count 484 transition count 968
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 975 place count 445 transition count 984
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 3 with 23 rules applied. Total rules applied 998 place count 445 transition count 961
Free-agglomeration rule applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 1023 place count 445 transition count 936
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1062 place count 420 transition count 922
Applied a total of 1062 rules in 547 ms. Remains 420 /932 variables (removed 512) and now considering 922/1422 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 547 ms. Remains : 420/932 places, 922/1422 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 922 rows 420 cols
[2023-03-14 03:44:50] [INFO ] Computed 66 place invariants in 23 ms
[2023-03-14 03:44:50] [INFO ] [Real]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-14 03:44:51] [INFO ] After 455ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:44:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 24 ms returned sat
[2023-03-14 03:44:51] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:44:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-14 03:44:51] [INFO ] After 104ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:44:51] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-14 03:44:51] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 922/922 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 420 transition count 920
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 418 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 417 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 417 transition count 916
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 0 with 2 rules applied. Total rules applied 8 place count 416 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 415 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 415 transition count 913
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 414 transition count 915
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 414 transition count 911
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 412 transition count 902
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 412 transition count 902
Applied a total of 20 rules in 89 ms. Remains 412 /420 variables (removed 8) and now considering 902/922 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 412/420 places, 902/922 transitions.
Finished random walk after 4143 steps, including 28 resets, run visited all 1 properties in 25 ms. (steps per millisecond=165 )
FORMULA NoC3x3-PT-6B-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 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' '!(X(X(G(p0))))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 339 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-14 03:44:52] [INFO ] Computed 66 place invariants in 15 ms
[2023-03-14 03:44:53] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-14 03:44:53] [INFO ] Invariant cache hit.
[2023-03-14 03:44:55] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2332 ms to find 0 implicit places.
[2023-03-14 03:44:55] [INFO ] Invariant cache hit.
[2023-03-14 03:44:56] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4207 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-00 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: 2}]], initial=3, aps=[p0:(EQ s274 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-00 finished in 4570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||(p2 U (p3||G(p2))))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 200 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-14 03:44:57] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-14 03:44:58] [INFO ] Implicit Places using invariants in 835 ms returned []
[2023-03-14 03:44:58] [INFO ] Invariant cache hit.
[2023-03-14 03:44:59] [INFO ] Implicit Places using invariants and state equation in 1768 ms returned []
Implicit Place search using SMT with State Equation took 2606 ms to find 0 implicit places.
[2023-03-14 03:44:59] [INFO ] Invariant cache hit.
[2023-03-14 03:45:01] [INFO ] Dead Transitions using invariants and state equation in 1614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4423 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p3) p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(OR (AND (EQ s436 1) (EQ s460 1)) (AND (EQ s679 1) (EQ s713 1))), p3:(AND (NEQ s671 1) (NEQ s0 1)), p2:(NEQ s0 1), p1:(AND (EQ s436 1) (EQ s460 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2054 ms.
Product exploration explored 100000 steps with 50000 reset in 1399 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Detected a total of 65/900 stabilizing places and 65/1351 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p3) (NOT p2))))
Knowledge based reduction with 15 factoid took 416 ms. Reduced automaton from 8 states, 17 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLFireability-01 finished in 8684 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(G(p1))) U p2))))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 921 transition count 1397
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 921 transition count 1397
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 913 transition count 1382
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 913 transition count 1382
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 909 transition count 1368
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 909 transition count 1368
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1364
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1358
Applied a total of 59 rules in 268 ms. Remains 904 /932 variables (removed 28) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 904 cols
[2023-03-14 03:45:06] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 03:45:06] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-14 03:45:06] [INFO ] Invariant cache hit.
[2023-03-14 03:45:08] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2331 ms to find 0 implicit places.
[2023-03-14 03:45:08] [INFO ] Invariant cache hit.
[2023-03-14 03:45:09] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4006 ms. Remains : 904/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s143 1) (EQ s168 1)), p0:(EQ s214 1), p1:(EQ s538 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-02 finished in 4371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 5 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1114
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1091
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1091
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1090
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1090
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1082
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1080
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1080
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1079
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 5 with 354 rules applied. Total rules applied 713 place count 575 transition count 902
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 915 place count 474 transition count 932
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 993 place count 435 transition count 947
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1017 place count 435 transition count 923
Applied a total of 1017 rules in 437 ms. Remains 435 /932 variables (removed 497) and now considering 923/1422 (removed 499) transitions.
// Phase 1: matrix 923 rows 435 cols
[2023-03-14 03:45:10] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-14 03:45:10] [INFO ] Implicit Places using invariants in 457 ms returned [10, 45, 93, 132, 193, 275, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 463 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/932 places, 923/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 899
Applied a total of 48 rules in 27 ms. Remains 402 /426 variables (removed 24) and now considering 899/923 (removed 24) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-14 03:45:11] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 03:45:11] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-14 03:45:11] [INFO ] Invariant cache hit.
[2023-03-14 03:45:12] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:12] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/932 places, 899/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2749 ms. Remains : 402/932 places, 899/1422 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s131 0)), p1:(EQ s203 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 689 reset in 775 ms.
Product exploration explored 100000 steps with 693 reset in 715 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:45:14] [INFO ] Invariant cache hit.
[2023-03-14 03:45:14] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:15] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-14 03:45:15] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:15] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:15] [INFO ] After 80ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:15] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-14 03:45:15] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 34 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242971 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242971 steps, saw 66563 distinct states, run finished after 3002 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2023-03-14 03:45:18] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 03:45:18] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:18] [INFO ] [Nat]Absence check using 57 positive place invariants in 16 ms returned sat
[2023-03-14 03:45:19] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:19] [INFO ] After 70ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:19] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-14 03:45:19] [INFO ] After 571ms 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 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 14 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 13 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-14 03:45:19] [INFO ] Invariant cache hit.
[2023-03-14 03:45:19] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-14 03:45:19] [INFO ] Invariant cache hit.
[2023-03-14 03:45:20] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:21] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
[2023-03-14 03:45:21] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-14 03:45:21] [INFO ] Invariant cache hit.
[2023-03-14 03:45:22] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2682 ms. Remains : 377/377 places, 860/860 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 61 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2023-03-14 03:45:22] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-14 03:45:22] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:22] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-14 03:45:22] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:22] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-14 03:45:22] [INFO ] After 571ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 26 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-14 03:45:23] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 03:45:23] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-14 03:45:23] [INFO ] Invariant cache hit.
[2023-03-14 03:45:24] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:24] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1488 ms to find 0 implicit places.
[2023-03-14 03:45:24] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 03:45:24] [INFO ] Invariant cache hit.
[2023-03-14 03:45:25] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2467 ms. Remains : 402/402 places, 899/899 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 254 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:45:26] [INFO ] Invariant cache hit.
[2023-03-14 03:45:26] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:26] [INFO ] [Nat]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-14 03:45:26] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:26] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:27] [INFO ] After 117ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:27] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-14 03:45:27] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 899/899 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 402 transition count 874
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 64 place count 377 transition count 860
Applied a total of 64 rules in 28 ms. Remains 377 /402 variables (removed 25) and now considering 860/899 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 377/402 places, 860/899 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265493 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265493 steps, saw 72782 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 860 rows 377 cols
[2023-03-14 03:45:30] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-14 03:45:30] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:30] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 03:45:30] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:30] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:31] [INFO ] After 109ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:31] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-14 03:45:31] [INFO ] After 793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 10 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 377/377 places, 860/860 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 860/860 transitions.
Applied a total of 0 rules in 11 ms. Remains 377 /377 variables (removed 0) and now considering 860/860 (removed 0) transitions.
[2023-03-14 03:45:31] [INFO ] Invariant cache hit.
[2023-03-14 03:45:31] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-14 03:45:31] [INFO ] Invariant cache hit.
[2023-03-14 03:45:32] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:32] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1619 ms to find 0 implicit places.
[2023-03-14 03:45:32] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 03:45:32] [INFO ] Invariant cache hit.
[2023-03-14 03:45:33] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2180 ms. Remains : 377/377 places, 860/860 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 377 transition count 848
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 377 transition count 848
Applied a total of 15 rules in 52 ms. Remains 377 /377 variables (removed 0) and now considering 848/860 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 848 rows 377 cols
[2023-03-14 03:45:33] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 03:45:33] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:45:33] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2023-03-14 03:45:34] [INFO ] After 477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:45:34] [INFO ] After 558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-14 03:45:34] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 690 reset in 561 ms.
Product exploration explored 100000 steps with 675 reset in 546 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 899/899 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 402 cols
[2023-03-14 03:45:36] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:45:36] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-14 03:45:36] [INFO ] Invariant cache hit.
[2023-03-14 03:45:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:37] [INFO ] Implicit Places using invariants and state equation in 1346 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
[2023-03-14 03:45:37] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 03:45:37] [INFO ] Invariant cache hit.
[2023-03-14 03:45:38] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2797 ms. Remains : 402/402 places, 899/899 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-03 finished in 28975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(!p0&&(p1 U (G(p1)||(p1&&G(!p2)))))))))'
Support contains 5 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 910 transition count 1377
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 910 transition count 1377
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 906 transition count 1363
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 906 transition count 1363
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 903 transition count 1359
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 903 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1356
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1356
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 901 transition count 1353
Applied a total of 65 rules in 155 ms. Remains 901 /932 variables (removed 31) and now considering 1353/1422 (removed 69) transitions.
// Phase 1: matrix 1353 rows 901 cols
[2023-03-14 03:45:39] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-14 03:45:39] [INFO ] Implicit Places using invariants in 777 ms returned []
[2023-03-14 03:45:40] [INFO ] Invariant cache hit.
[2023-03-14 03:45:41] [INFO ] Implicit Places using invariants and state equation in 1556 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2023-03-14 03:45:41] [INFO ] Invariant cache hit.
[2023-03-14 03:45:43] [INFO ] Dead Transitions using invariants and state equation in 1526 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 901/932 places, 1353/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4020 ms. Remains : 901/932 places, 1353/1422 transitions.
Stuttering acceptance computed with spot in 453 ms :[true, p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1) p2), p2, (NOT p1), (AND p0 p2), (AND p2 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 8}], [{ cond=p2, acceptance={} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 p0), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (EQ s136 1) (EQ s224 1)), p1:(NEQ s372 1), p2:(AND (EQ s83 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 224 reset in 644 ms.
Entered a terminal (fully accepting) state of product in 25499 steps with 59 reset in 146 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-04 finished in 5301 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 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1398
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1398
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1383
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1383
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 908 transition count 1375
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 906 transition count 1372
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 906 transition count 1372
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 905 transition count 1370
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 905 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 904 transition count 1369
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 904 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 904 transition count 1366
Applied a total of 59 rules in 148 ms. Remains 904 /932 variables (removed 28) and now considering 1366/1422 (removed 56) transitions.
// Phase 1: matrix 1366 rows 904 cols
[2023-03-14 03:45:44] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-14 03:45:45] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-14 03:45:45] [INFO ] Invariant cache hit.
[2023-03-14 03:45:47] [INFO ] Implicit Places using invariants and state equation in 1729 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-14 03:45:47] [INFO ] Invariant cache hit.
[2023-03-14 03:45:48] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/932 places, 1366/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4107 ms. Remains : 904/932 places, 1366/1422 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-07 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 s755 1) (EQ s819 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 538 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-07 finished in 4206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 299 place count 764 transition count 1112
Iterating global reduction 2 with 35 rules applied. Total rules applied 334 place count 764 transition count 1112
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 342 place count 756 transition count 1096
Iterating global reduction 2 with 8 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 transition count 1084
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 5 with 354 rules applied. Total rules applied 715 place count 574 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 939
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 954
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1021 place count 434 transition count 928
Applied a total of 1021 rules in 203 ms. Remains 434 /932 variables (removed 498) and now considering 928/1422 (removed 494) transitions.
[2023-03-14 03:45:48] [INFO ] Flow matrix only has 924 transitions (discarded 4 similar events)
// Phase 1: matrix 924 rows 434 cols
[2023-03-14 03:45:48] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-14 03:45:49] [INFO ] Implicit Places using invariants in 708 ms returned [10, 47, 95, 134, 194, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 710 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 928/1422 transitions.
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 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 904
Applied a total of 48 rules in 30 ms. Remains 401 /425 variables (removed 24) and now considering 904/928 (removed 24) transitions.
[2023-03-14 03:45:49] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
// Phase 1: matrix 900 rows 401 cols
[2023-03-14 03:45:49] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 03:45:50] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-14 03:45:50] [INFO ] Flow matrix only has 900 transitions (discarded 4 similar events)
[2023-03-14 03:45:50] [INFO ] Invariant cache hit.
[2023-03-14 03:45:50] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-14 03:45:51] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 904/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2594 ms. Remains : 401/932 places, 904/1422 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-08 finished in 2648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 4 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1121
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 341 place count 756 transition count 1096
Iterating global reduction 2 with 9 rules applied. Total rules applied 350 place count 756 transition count 1096
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 351 place count 756 transition count 1095
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 352 place count 755 transition count 1095
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 355 place count 752 transition count 1087
Iterating global reduction 4 with 3 rules applied. Total rules applied 358 place count 752 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 359 place count 751 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 751 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 751 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 711 place count 576 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 913 place count 475 transition count 941
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 989 place count 437 transition count 953
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1013 place count 437 transition count 929
Applied a total of 1013 rules in 271 ms. Remains 437 /932 variables (removed 495) and now considering 929/1422 (removed 493) transitions.
// Phase 1: matrix 929 rows 437 cols
[2023-03-14 03:45:51] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-14 03:45:52] [INFO ] Implicit Places using invariants in 578 ms returned [11, 48, 96, 135, 276, 326, 365, 414]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 580 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 429/932 places, 929/1422 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 409 transition count 909
Applied a total of 40 rules in 32 ms. Remains 409 /429 variables (removed 20) and now considering 909/929 (removed 20) transitions.
// Phase 1: matrix 909 rows 409 cols
[2023-03-14 03:45:52] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 03:45:52] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-14 03:45:52] [INFO ] Invariant cache hit.
[2023-03-14 03:45:53] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:45:54] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1912 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 409/932 places, 909/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2797 ms. Remains : 409/932 places, 909/1422 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s381 1) (EQ s395 1)), p1:(AND (EQ s32 1) (EQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-09 finished in 2905 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)&&X(!p2)))))'
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 906 transition count 1367
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 906 transition count 1367
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 904 transition count 1364
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 904 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1361
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1358
Applied a total of 63 rules in 224 ms. Remains 902 /932 variables (removed 30) and now considering 1358/1422 (removed 64) transitions.
// Phase 1: matrix 1358 rows 902 cols
[2023-03-14 03:45:54] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-14 03:45:55] [INFO ] Implicit Places using invariants in 850 ms returned []
[2023-03-14 03:45:55] [INFO ] Invariant cache hit.
[2023-03-14 03:45:56] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2412 ms to find 0 implicit places.
[2023-03-14 03:45:56] [INFO ] Invariant cache hit.
[2023-03-14 03:45:58] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1358/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3933 ms. Remains : 902/932 places, 1358/1422 transitions.
Stuttering acceptance computed with spot in 226 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s400 1) (EQ s558 1)), p0:(AND (EQ s847 1) (EQ s897 1) (NOT (AND (EQ s761 1) (EQ s821 1)))), p2:(AND (EQ s761 1) (EQ s821 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 246 reset in 487 ms.
Product exploration explored 100000 steps with 250 reset in 638 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 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2023-03-14 03:46:00] [INFO ] Invariant cache hit.
[2023-03-14 03:46:00] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2023-03-14 03:46:01] [INFO ] After 1050ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-14 03:46:01] [INFO ] [Nat]Absence check using 66 positive place invariants in 47 ms returned sat
[2023-03-14 03:46:02] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 03:46:02] [INFO ] After 878ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-14 03:46:02] [INFO ] After 1135ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 902 transition count 1330
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 874 transition count 1330
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 874 transition count 1235
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 779 transition count 1235
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 756 transition count 1087
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 756 transition count 1087
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 652 place count 576 transition count 907
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 854 place count 475 transition count 937
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 932 place count 436 transition count 957
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 958 place count 436 transition count 931
Free-agglomeration rule applied 24 times.
Iterating global reduction 2 with 24 rules applied. Total rules applied 982 place count 436 transition count 907
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 1018 place count 412 transition count 895
Applied a total of 1018 rules in 249 ms. Remains 412 /902 variables (removed 490) and now considering 895/1358 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 412/902 places, 895/1358 transitions.
Finished random walk after 1129 steps, including 7 resets, run visited all 1 properties in 10 ms. (steps per millisecond=112 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 776 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 151 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1358/1358 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 901 transition count 1329
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 873 transition count 1329
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 56 place count 873 transition count 1234
Deduced a syphon composed of 95 places in 3 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 246 place count 778 transition count 1234
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 755 transition count 1086
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 755 transition count 1086
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 177
Deduced a syphon composed of 177 places in 0 ms
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 2 with 354 rules applied. Total rules applied 646 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 848 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 924 place count 439 transition count 959
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 2 with 26 rules applied. Total rules applied 950 place count 439 transition count 933
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 951 place count 438 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 952 place count 437 transition count 932
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 956 place count 435 transition count 930
Applied a total of 956 rules in 143 ms. Remains 435 /902 variables (removed 467) and now considering 930/1358 (removed 428) transitions.
// Phase 1: matrix 930 rows 435 cols
[2023-03-14 03:46:04] [INFO ] Computed 65 place invariants in 6 ms
[2023-03-14 03:46:04] [INFO ] Implicit Places using invariants in 622 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 626 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/902 places, 930/1358 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 908
Applied a total of 44 rules in 19 ms. Remains 405 /427 variables (removed 22) and now considering 908/930 (removed 22) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-14 03:46:04] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 03:46:05] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-14 03:46:05] [INFO ] Invariant cache hit.
[2023-03-14 03:46:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 03:46:06] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 405/902 places, 908/1358 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2655 ms. Remains : 405/902 places, 908/1358 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 295 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 134 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 4165 steps, including 26 resets, run visited all 3 properties in 86 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 501 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 149 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 139 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 136 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 694 reset in 458 ms.
Product exploration explored 100000 steps with 675 reset in 502 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 11 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-14 03:46:09] [INFO ] Invariant cache hit.
[2023-03-14 03:46:09] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-14 03:46:09] [INFO ] Invariant cache hit.
[2023-03-14 03:46:10] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 03:46:10] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1469 ms to find 0 implicit places.
[2023-03-14 03:46:10] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 03:46:10] [INFO ] Invariant cache hit.
[2023-03-14 03:46:11] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2023 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 17254 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(p1)&&p0)))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 920 transition count 1399
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 920 transition count 1399
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 913 transition count 1386
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 913 transition count 1386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 910 transition count 1378
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 910 transition count 1378
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 908 transition count 1375
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 908 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 907 transition count 1373
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 907 transition count 1373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 906 transition count 1372
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 906 transition count 1372
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 906 transition count 1369
Applied a total of 55 rules in 169 ms. Remains 906 /932 variables (removed 26) and now considering 1369/1422 (removed 53) transitions.
// Phase 1: matrix 1369 rows 906 cols
[2023-03-14 03:46:11] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-14 03:46:12] [INFO ] Implicit Places using invariants in 797 ms returned []
[2023-03-14 03:46:12] [INFO ] Invariant cache hit.
[2023-03-14 03:46:13] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2023-03-14 03:46:13] [INFO ] Invariant cache hit.
[2023-03-14 03:46:15] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 906/932 places, 1369/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4094 ms. Remains : 906/932 places, 1369/1422 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s536 1), p0:(AND (EQ s306 1) (EQ s361 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-11 finished in 4288 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(F(p0))||G(p1))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 919 transition count 1393
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 919 transition count 1393
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 911 transition count 1378
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 911 transition count 1378
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 907 transition count 1364
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 907 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 904 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 904 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 903 transition count 1358
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 903 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 902 transition count 1357
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 902 transition count 1357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 902 transition count 1354
Applied a total of 63 rules in 266 ms. Remains 902 /932 variables (removed 30) and now considering 1354/1422 (removed 68) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-14 03:46:15] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-14 03:46:16] [INFO ] Implicit Places using invariants in 702 ms returned []
[2023-03-14 03:46:16] [INFO ] Invariant cache hit.
[2023-03-14 03:46:18] [INFO ] Implicit Places using invariants and state equation in 1853 ms returned []
Implicit Place search using SMT with State Equation took 2557 ms to find 0 implicit places.
[2023-03-14 03:46:18] [INFO ] Invariant cache hit.
[2023-03-14 03:46:19] [INFO ] Dead Transitions using invariants and state equation in 1435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/932 places, 1354/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4260 ms. Remains : 902/932 places, 1354/1422 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s299 1) (EQ s350 1)), p0:(EQ s168 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 221 reset in 332 ms.
Product exploration explored 100000 steps with 218 reset in 360 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 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 4834 steps, including 9 resets, run visited all 3 properties in 71 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 19 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
[2023-03-14 03:46:22] [INFO ] Invariant cache hit.
[2023-03-14 03:46:23] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-14 03:46:23] [INFO ] Invariant cache hit.
[2023-03-14 03:46:24] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
[2023-03-14 03:46:24] [INFO ] Invariant cache hit.
[2023-03-14 03:46:25] [INFO ] Dead Transitions using invariants and state equation in 1332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3541 ms. Remains : 902/902 places, 1354/1354 transitions.
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 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 22 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 03:46:26] [INFO ] Invariant cache hit.
[2023-03-14 03:46:26] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 03:46:27] [INFO ] [Nat]Absence check using 66 positive place invariants in 45 ms returned sat
[2023-03-14 03:46:28] [INFO ] After 1087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 03:46:28] [INFO ] After 1427ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-14 03:46:28] [INFO ] After 1890ms 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 13 ms.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1327
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 875 transition count 1327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 54 place count 875 transition count 1231
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 246 place count 779 transition count 1231
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 270 place count 755 transition count 1081
Iterating global reduction 2 with 24 rules applied. Total rules applied 294 place count 755 transition count 1081
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 356 rules applied. Total rules applied 650 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 852 place count 476 transition count 933
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 932 place count 436 transition count 955
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 956 place count 436 transition count 931
Free-agglomeration rule applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 979 place count 436 transition count 908
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 37 rules applied. Total rules applied 1016 place count 413 transition count 894
Applied a total of 1016 rules in 225 ms. Remains 413 /902 variables (removed 489) and now considering 894/1354 (removed 460) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 413/902 places, 894/1354 transitions.
Finished random walk after 1990 steps, including 14 resets, run visited all 2 properties in 48 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 227 reset in 446 ms.
Product exploration explored 100000 steps with 227 reset in 540 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 902 transition count 1354
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 27 place count 902 transition count 1406
Deduced a syphon composed of 79 places in 6 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 79 place count 902 transition count 1406
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 301 places in 1 ms
Iterating global reduction 1 with 222 rules applied. Total rules applied 301 place count 902 transition count 1406
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 382 place count 821 transition count 1199
Deduced a syphon composed of 244 places in 0 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 463 place count 821 transition count 1199
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 487 place count 797 transition count 1175
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 511 place count 797 transition count 1175
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -308
Deduced a syphon composed of 321 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 612 place count 797 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 613 place count 796 transition count 1481
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 614 place count 796 transition count 1481
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -113
Deduced a syphon composed of 358 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 652 place count 796 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 653 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 654 place count 795 transition count 1592
Deduced a syphon composed of 357 places in 1 ms
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 678 place count 795 transition count 1568
Deduced a syphon composed of 357 places in 1 ms
Applied a total of 678 rules in 530 ms. Remains 795 /902 variables (removed 107) and now considering 1568/1354 (removed -214) transitions.
[2023-03-14 03:46:32] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 1568 rows 795 cols
[2023-03-14 03:46:32] [INFO ] Computed 66 place invariants in 9 ms
[2023-03-14 03:46:33] [INFO ] Dead Transitions using invariants and state equation in 1238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 795/902 places, 1568/1354 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1817 ms. Remains : 795/902 places, 1568/1354 transitions.
Support contains 3 out of 902 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 902/902 places, 1354/1354 transitions.
Applied a total of 0 rules in 29 ms. Remains 902 /902 variables (removed 0) and now considering 1354/1354 (removed 0) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2023-03-14 03:46:33] [INFO ] Computed 66 place invariants in 4 ms
[2023-03-14 03:46:34] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-14 03:46:34] [INFO ] Invariant cache hit.
[2023-03-14 03:46:35] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-14 03:46:35] [INFO ] Invariant cache hit.
[2023-03-14 03:46:36] [INFO ] Dead Transitions using invariants and state equation in 1261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3288 ms. Remains : 902/902 places, 1354/1354 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 21283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 932 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 66 place count 898 transition count 1289
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 264 place count 799 transition count 1289
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 300 place count 763 transition count 1111
Iterating global reduction 2 with 36 rules applied. Total rules applied 336 place count 763 transition count 1111
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 345 place count 754 transition count 1086
Iterating global reduction 2 with 9 rules applied. Total rules applied 354 place count 754 transition count 1086
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 754 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 359 place count 750 transition count 1077
Iterating global reduction 4 with 3 rules applied. Total rules applied 362 place count 750 transition count 1077
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 363 place count 749 transition count 1075
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 749 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 365 place count 749 transition count 1074
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 715 place count 574 transition count 899
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 917 place count 473 transition count 929
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 995 place count 434 transition count 941
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1019 place count 434 transition count 917
Applied a total of 1019 rules in 179 ms. Remains 434 /932 variables (removed 498) and now considering 917/1422 (removed 505) transitions.
// Phase 1: matrix 917 rows 434 cols
[2023-03-14 03:46:37] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-14 03:46:37] [INFO ] Implicit Places using invariants in 491 ms returned [11, 46, 94, 133, 193, 274, 324, 363, 412]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 495 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 425/932 places, 917/1422 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 893
Applied a total of 48 rules in 27 ms. Remains 401 /425 variables (removed 24) and now considering 893/917 (removed 24) transitions.
// Phase 1: matrix 893 rows 401 cols
[2023-03-14 03:46:37] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 03:46:37] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-14 03:46:37] [INFO ] Invariant cache hit.
[2023-03-14 03:46:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-14 03:46:38] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 401/932 places, 893/1422 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1934 ms. Remains : 401/932 places, 893/1422 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-13 finished in 2000 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(X(X(F((G(p1)&&p0))))))))'
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 918 transition count 1392
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 918 transition count 1392
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 909 transition count 1375
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 909 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 905 transition count 1361
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 905 transition count 1361
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 902 transition count 1357
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 902 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 901 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 901 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 900 transition count 1354
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 900 transition count 1354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 67 place count 900 transition count 1351
Applied a total of 67 rules in 192 ms. Remains 900 /932 variables (removed 32) and now considering 1351/1422 (removed 71) transitions.
// Phase 1: matrix 1351 rows 900 cols
[2023-03-14 03:46:39] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-14 03:46:40] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-14 03:46:40] [INFO ] Invariant cache hit.
[2023-03-14 03:46:41] [INFO ] Implicit Places using invariants and state equation in 1651 ms returned []
Implicit Place search using SMT with State Equation took 2530 ms to find 0 implicit places.
[2023-03-14 03:46:41] [INFO ] Invariant cache hit.
[2023-03-14 03:46:42] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 900/932 places, 1351/1422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3950 ms. Remains : 900/932 places, 1351/1422 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s429 1) (EQ s458 1)), p1:(NEQ s843 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 479 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLFireability-14 finished in 4225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X((p1&&G(F(p1)))))))'
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)&&X(!p2)))))'
Found a Shortening insensitive property : NoC3x3-PT-6B-LTLFireability-10
Stuttering acceptance computed with spot in 221 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Support contains 6 out of 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 66 place count 898 transition count 1291
Deduced a syphon composed of 97 places in 5 ms
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 2 with 194 rules applied. Total rules applied 260 place count 801 transition count 1291
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 295 place count 766 transition count 1118
Iterating global reduction 2 with 35 rules applied. Total rules applied 330 place count 766 transition count 1118
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 339 place count 757 transition count 1093
Iterating global reduction 2 with 9 rules applied. Total rules applied 348 place count 757 transition count 1093
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1092
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 352 place count 754 transition count 1087
Iterating global reduction 4 with 2 rules applied. Total rules applied 354 place count 754 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 355 place count 753 transition count 1085
Iterating global reduction 4 with 1 rules applied. Total rules applied 356 place count 753 transition count 1085
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 357 place count 753 transition count 1084
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 707 place count 578 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 909 place count 477 transition count 939
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 5 with 76 rules applied. Total rules applied 985 place count 439 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 986 place count 438 transition count 958
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 987 place count 437 transition count 958
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 991 place count 435 transition count 956
Applied a total of 991 rules in 292 ms. Remains 435 /932 variables (removed 497) and now considering 956/1422 (removed 466) transitions.
// Phase 1: matrix 956 rows 435 cols
[2023-03-14 03:46:43] [INFO ] Computed 65 place invariants in 4 ms
[2023-03-14 03:46:44] [INFO ] Implicit Places using invariants in 526 ms returned [10, 45, 93, 132, 192, 272, 322, 363]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 529 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 427/932 places, 956/1422 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 405 transition count 934
Applied a total of 44 rules in 15 ms. Remains 405 /427 variables (removed 22) and now considering 934/956 (removed 22) transitions.
// Phase 1: matrix 934 rows 405 cols
[2023-03-14 03:46:44] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:46:44] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-14 03:46:44] [INFO ] Invariant cache hit.
[2023-03-14 03:46:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 03:46:45] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 405/932 places, 934/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2159 ms. Remains : 405/932 places, 934/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s159 1) (EQ s229 1)), p0:(AND (EQ s374 1) (EQ s401 1) (NOT (AND (EQ s335 1) (EQ s359 1)))), p2:(AND (EQ s335 1) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 703 reset in 436 ms.
Product exploration explored 100000 steps with 706 reset in 689 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 509 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[p0, (AND p0 (NOT p1)), (AND p1 p2 p0), p0]
Incomplete random walk after 10000 steps, including 68 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 03:46:48] [INFO ] Invariant cache hit.
[2023-03-14 03:46:48] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-14 03:46:48] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-14 03:46:48] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-14 03:46:49] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-14 03:46:49] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 03:46:49] [INFO ] After 106ms SMT Verify possible using 65 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-14 03:46:49] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-14 03:46:49] [INFO ] After 905ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 405 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 405/405 places, 934/934 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 404 transition count 933
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 403 transition count 933
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 30 place count 403 transition count 907
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 54 place count 403 transition count 883
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 90 place count 379 transition count 871
Applied a total of 90 rules in 68 ms. Remains 379 /405 variables (removed 26) and now considering 871/934 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 379/405 places, 871/934 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Finished Best-First random walk after 2327 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=387 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (G (NOT (AND p1 p2 p0)))]
False Knowledge obtained : [(F (AND p1 p2)), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 12 factoid took 837 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 151 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 934/934 transitions.
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 405 transition count 908
Applied a total of 26 rules in 31 ms. Remains 405 /405 variables (removed 0) and now considering 908/934 (removed 26) transitions.
// Phase 1: matrix 908 rows 405 cols
[2023-03-14 03:46:51] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:46:51] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-14 03:46:51] [INFO ] Invariant cache hit.
[2023-03-14 03:46:52] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 03:46:52] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
[2023-03-14 03:46:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 03:46:52] [INFO ] Invariant cache hit.
[2023-03-14 03:46:53] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 405/405 places, 908/934 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2822 ms. Remains : 405/405 places, 908/934 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 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 99 ms :[p0, (AND (NOT p1) p0), p0]
Finished random walk after 1986 steps, including 11 resets, run visited all 3 properties in 20 ms. (steps per millisecond=99 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 7 factoid took 415 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 150 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 149 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 150 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 691 reset in 716 ms.
Product exploration explored 100000 steps with 678 reset in 475 ms.
Support contains 6 out of 405 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 405/405 places, 908/908 transitions.
Applied a total of 0 rules in 9 ms. Remains 405 /405 variables (removed 0) and now considering 908/908 (removed 0) transitions.
[2023-03-14 03:46:56] [INFO ] Invariant cache hit.
[2023-03-14 03:46:56] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-14 03:46:56] [INFO ] Invariant cache hit.
[2023-03-14 03:46:57] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-14 03:46:58] [INFO ] Implicit Places using invariants and state equation in 1427 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2023-03-14 03:46:58] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 03:46:58] [INFO ] Invariant cache hit.
[2023-03-14 03:46:59] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3031 ms. Remains : 405/405 places, 908/908 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-10 finished in 16060 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(F(p0))||G(p1))))))'
Found a Lengthening insensitive property : NoC3x3-PT-6B-LTLFireability-12
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 932 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 932/932 places, 1422/1422 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 931 transition count 1388
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 898 transition count 1388
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 66 place count 898 transition count 1290
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 262 place count 800 transition count 1290
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 765 transition count 1113
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 765 transition count 1113
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 340 place count 757 transition count 1090
Iterating global reduction 2 with 8 rules applied. Total rules applied 348 place count 757 transition count 1090
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 757 transition count 1089
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 756 transition count 1089
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 353 place count 753 transition count 1081
Iterating global reduction 4 with 3 rules applied. Total rules applied 356 place count 753 transition count 1081
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 357 place count 752 transition count 1079
Iterating global reduction 4 with 1 rules applied. Total rules applied 358 place count 752 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 359 place count 752 transition count 1078
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 0 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 5 with 350 rules applied. Total rules applied 709 place count 577 transition count 903
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 911 place count 476 transition count 933
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 989 place count 437 transition count 945
Applied a total of 989 rules in 155 ms. Remains 437 /932 variables (removed 495) and now considering 945/1422 (removed 477) transitions.
// Phase 1: matrix 945 rows 437 cols
[2023-03-14 03:46:59] [INFO ] Computed 66 place invariants in 3 ms
[2023-03-14 03:47:00] [INFO ] Implicit Places using invariants in 749 ms returned [11, 46, 96, 136, 197, 277, 327, 366, 415]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 751 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 428/932 places, 945/1422 transitions.
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 0 with 48 rules applied. Total rules applied 48 place count 404 transition count 921
Applied a total of 48 rules in 21 ms. Remains 404 /428 variables (removed 24) and now considering 921/945 (removed 24) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-14 03:47:00] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:47:01] [INFO ] Implicit Places using invariants in 568 ms returned []
[2023-03-14 03:47:01] [INFO ] Invariant cache hit.
[2023-03-14 03:47:01] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 03:47:02] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 404/932 places, 921/1422 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2840 ms. Remains : 404/932 places, 921/1422 transitions.
Running random walk in product with property : NoC3x3-PT-6B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s109 1) (EQ s135 1)), p0:(EQ s48 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 680 reset in 575 ms.
Product exploration explored 100000 steps with 688 reset in 520 ms.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 504 steps, including 3 resets, run visited all 3 properties in 11 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 220 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 6 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
[2023-03-14 03:47:04] [INFO ] Invariant cache hit.
[2023-03-14 03:47:05] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-14 03:47:05] [INFO ] Invariant cache hit.
[2023-03-14 03:47:05] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 03:47:06] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
[2023-03-14 03:47:06] [INFO ] Invariant cache hit.
[2023-03-14 03:47:07] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2561 ms. Remains : 404/404 places, 921/921 transitions.
Computed a total of 2 stabilizing places and 6 stable transitions
Computed a total of 2 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 1056 steps, including 7 resets, run visited all 3 properties in 20 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 695 reset in 652 ms.
Product exploration explored 100000 steps with 687 reset in 456 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 404 transition count 897
Applied a total of 24 rules in 16 ms. Remains 404 /404 variables (removed 0) and now considering 897/921 (removed 24) transitions.
[2023-03-14 03:47:10] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 897 rows 404 cols
[2023-03-14 03:47:10] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 03:47:10] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/404 places, 897/921 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 929 ms. Remains : 404/404 places, 897/921 transitions.
Support contains 3 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 921/921 transitions.
Applied a total of 0 rules in 6 ms. Remains 404 /404 variables (removed 0) and now considering 921/921 (removed 0) transitions.
// Phase 1: matrix 921 rows 404 cols
[2023-03-14 03:47:11] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:47:11] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-14 03:47:11] [INFO ] Invariant cache hit.
[2023-03-14 03:47:12] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-14 03:47:12] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2023-03-14 03:47:13] [INFO ] Invariant cache hit.
[2023-03-14 03:47:14] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3018 ms. Remains : 404/404 places, 921/921 transitions.
Treatment of property NoC3x3-PT-6B-LTLFireability-12 finished in 14743 ms.
[2023-03-14 03:47:14] [INFO ] Flatten gal took : 118 ms
[2023-03-14 03:47:14] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 03:47:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 932 places, 1422 transitions and 4485 arcs took 21 ms.
Total runtime 159763 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-6B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

BK_STOP 1678766206467

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-6B-LTLFireability-03
lola: time limit : 1199 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-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1199 2/32 NoC3x3-PT-6B-LTLFireability-03 176698 m, 35339 m/sec, 749431 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1199 3/32 NoC3x3-PT-6B-LTLFireability-03 316940 m, 28048 m/sec, 1604317 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1199 4/32 NoC3x3-PT-6B-LTLFireability-03 446851 m, 25982 m/sec, 2458058 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1199 5/32 NoC3x3-PT-6B-LTLFireability-03 569973 m, 24624 m/sec, 3297504 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1199 6/32 NoC3x3-PT-6B-LTLFireability-03 703351 m, 26675 m/sec, 4151957 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1199 7/32 NoC3x3-PT-6B-LTLFireability-03 828918 m, 25113 m/sec, 5001713 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1199 8/32 NoC3x3-PT-6B-LTLFireability-03 939422 m, 22100 m/sec, 5784590 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1199 9/32 NoC3x3-PT-6B-LTLFireability-03 1048493 m, 21814 m/sec, 6640184 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/1199 10/32 NoC3x3-PT-6B-LTLFireability-03 1172564 m, 24814 m/sec, 7494293 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/1199 11/32 NoC3x3-PT-6B-LTLFireability-03 1300122 m, 25511 m/sec, 8351354 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/1199 13/32 NoC3x3-PT-6B-LTLFireability-03 1424976 m, 24970 m/sec, 9206240 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/1199 13/32 NoC3x3-PT-6B-LTLFireability-03 1535832 m, 22171 m/sec, 10057416 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/1199 14/32 NoC3x3-PT-6B-LTLFireability-03 1646470 m, 22127 m/sec, 10911718 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/1199 15/32 NoC3x3-PT-6B-LTLFireability-03 1760934 m, 22892 m/sec, 11691151 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/1199 16/32 NoC3x3-PT-6B-LTLFireability-03 1883636 m, 24540 m/sec, 12513292 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/1199 17/32 NoC3x3-PT-6B-LTLFireability-03 2013224 m, 25917 m/sec, 13348013 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/1199 18/32 NoC3x3-PT-6B-LTLFireability-03 2132080 m, 23771 m/sec, 14201258 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/1199 19/32 NoC3x3-PT-6B-LTLFireability-03 2250954 m, 23774 m/sec, 15054457 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/1199 20/32 NoC3x3-PT-6B-LTLFireability-03 2369515 m, 23712 m/sec, 15914821 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/1199 21/32 NoC3x3-PT-6B-LTLFireability-03 2479011 m, 21899 m/sec, 16773061 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/1199 22/32 NoC3x3-PT-6B-LTLFireability-03 2596607 m, 23519 m/sec, 17629406 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/1199 23/32 NoC3x3-PT-6B-LTLFireability-03 2706859 m, 22050 m/sec, 18485786 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/1199 24/32 NoC3x3-PT-6B-LTLFireability-03 2834583 m, 25544 m/sec, 19335569 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/1199 26/32 NoC3x3-PT-6B-LTLFireability-03 2998828 m, 32849 m/sec, 20178279 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/1199 27/32 NoC3x3-PT-6B-LTLFireability-03 3165545 m, 33343 m/sec, 21015863 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/1199 28/32 NoC3x3-PT-6B-LTLFireability-03 3328601 m, 32611 m/sec, 21829811 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/1199 30/32 NoC3x3-PT-6B-LTLFireability-03 3480146 m, 30309 m/sec, 22634403 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/1199 31/32 NoC3x3-PT-6B-LTLFireability-03 3623601 m, 28691 m/sec, 23440249 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/1199 32/32 NoC3x3-PT-6B-LTLFireability-03 3762020 m, 27683 m/sec, 24249337 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 NoC3x3-PT-6B-LTLFireability-12
lola: time limit : 1724 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-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1724 2/32 NoC3x3-PT-6B-LTLFireability-12 179475 m, 35895 m/sec, 770713 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1724 3/32 NoC3x3-PT-6B-LTLFireability-12 321087 m, 28322 m/sec, 1629103 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1724 4/32 NoC3x3-PT-6B-LTLFireability-12 450898 m, 25962 m/sec, 2486295 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1724 5/32 NoC3x3-PT-6B-LTLFireability-12 576584 m, 25137 m/sec, 3342185 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1724 7/32 NoC3x3-PT-6B-LTLFireability-12 710966 m, 26876 m/sec, 4200998 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1724 8/32 NoC3x3-PT-6B-LTLFireability-12 836675 m, 25141 m/sec, 5057471 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1724 9/32 NoC3x3-PT-6B-LTLFireability-12 956719 m, 24008 m/sec, 5916582 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1724 10/32 NoC3x3-PT-6B-LTLFireability-12 1066053 m, 21866 m/sec, 6773293 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1724 11/32 NoC3x3-PT-6B-LTLFireability-12 1194803 m, 25750 m/sec, 7632924 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1724 12/32 NoC3x3-PT-6B-LTLFireability-12 1315292 m, 24097 m/sec, 8456725 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1724 13/32 NoC3x3-PT-6B-LTLFireability-12 1434442 m, 23830 m/sec, 9278441 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1724 14/32 NoC3x3-PT-6B-LTLFireability-12 1543986 m, 21908 m/sec, 10130465 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1724 15/32 NoC3x3-PT-6B-LTLFireability-12 1657401 m, 22683 m/sec, 10984281 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1724 15/32 NoC3x3-PT-6B-LTLFireability-12 1783311 m, 25182 m/sec, 11837611 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/1724 17/32 NoC3x3-PT-6B-LTLFireability-12 1914929 m, 26323 m/sec, 12695201 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/1724 18/32 NoC3x3-PT-6B-LTLFireability-12 2043013 m, 25616 m/sec, 13555578 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/1724 19/32 NoC3x3-PT-6B-LTLFireability-12 2159501 m, 23297 m/sec, 14408348 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/1724 20/32 NoC3x3-PT-6B-LTLFireability-12 2281290 m, 24357 m/sec, 15263833 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 95/1724 21/32 NoC3x3-PT-6B-LTLFireability-12 2396475 m, 23037 m/sec, 16124289 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 100/1724 22/32 NoC3x3-PT-6B-LTLFireability-12 2506125 m, 21930 m/sec, 16982408 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 105/1724 23/32 NoC3x3-PT-6B-LTLFireability-12 2619710 m, 22717 m/sec, 17805150 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 110/1724 23/32 NoC3x3-PT-6B-LTLFireability-12 2729154 m, 21888 m/sec, 18662855 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 115/1724 25/32 NoC3x3-PT-6B-LTLFireability-12 2867877 m, 27744 m/sec, 19510703 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 120/1724 26/32 NoC3x3-PT-6B-LTLFireability-12 3040282 m, 34481 m/sec, 20352258 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 125/1724 28/32 NoC3x3-PT-6B-LTLFireability-12 3203818 m, 32707 m/sec, 21191156 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 130/1724 29/32 NoC3x3-PT-6B-LTLFireability-12 3365536 m, 32343 m/sec, 22005718 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 135/1724 30/32 NoC3x3-PT-6B-LTLFireability-12 3513637 m, 29620 m/sec, 22816846 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 140/1724 31/32 NoC3x3-PT-6B-LTLFireability-12 3652267 m, 27726 m/sec, 23626855 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 145/1724 32/32 NoC3x3-PT-6B-LTLFireability-12 3799183 m, 29383 m/sec, 24445836 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 301 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 NoC3x3-PT-6B-LTLFireability-10
lola: time limit : 3299 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-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3299 3/32 NoC3x3-PT-6B-LTLFireability-10 229755 m, 45951 m/sec, 713279 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3299 3/32 NoC3x3-PT-6B-LTLFireability-10 324993 m, 19047 m/sec, 1575496 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3299 4/32 NoC3x3-PT-6B-LTLFireability-10 411844 m, 17370 m/sec, 2432137 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3299 4/32 NoC3x3-PT-6B-LTLFireability-10 504112 m, 18453 m/sec, 3281021 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3299 5/32 NoC3x3-PT-6B-LTLFireability-10 600603 m, 19298 m/sec, 4129955 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3299 6/32 NoC3x3-PT-6B-LTLFireability-10 683382 m, 16555 m/sec, 4983179 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3299 6/32 NoC3x3-PT-6B-LTLFireability-10 766160 m, 16555 m/sec, 5848090 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3299 7/32 NoC3x3-PT-6B-LTLFireability-10 846372 m, 16042 m/sec, 6708170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3299 7/32 NoC3x3-PT-6B-LTLFireability-10 932143 m, 17154 m/sec, 7566838 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3299 8/32 NoC3x3-PT-6B-LTLFireability-10 1011083 m, 15788 m/sec, 8414399 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3299 8/32 NoC3x3-PT-6B-LTLFireability-10 1091950 m, 16173 m/sec, 9208651 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3299 9/32 NoC3x3-PT-6B-LTLFireability-10 1167598 m, 15129 m/sec, 10041502 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3299 10/32 NoC3x3-PT-6B-LTLFireability-10 1251096 m, 16699 m/sec, 10868330 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3299 10/32 NoC3x3-PT-6B-LTLFireability-10 1333225 m, 16425 m/sec, 11717375 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3299 11/32 NoC3x3-PT-6B-LTLFireability-10 1415471 m, 16449 m/sec, 12564363 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3299 11/32 NoC3x3-PT-6B-LTLFireability-10 1501812 m, 17268 m/sec, 13416358 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3299 12/32 NoC3x3-PT-6B-LTLFireability-10 1585689 m, 16775 m/sec, 14268554 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/3299 12/32 NoC3x3-PT-6B-LTLFireability-10 1666792 m, 16220 m/sec, 15111775 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/3299 13/32 NoC3x3-PT-6B-LTLFireability-10 1751372 m, 16916 m/sec, 15951249 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/3299 13/32 NoC3x3-PT-6B-LTLFireability-10 1831211 m, 15967 m/sec, 16803145 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/3299 14/32 NoC3x3-PT-6B-LTLFireability-10 1909134 m, 15584 m/sec, 17657851 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/3299 15/32 NoC3x3-PT-6B-LTLFireability-10 1994000 m, 16973 m/sec, 18507314 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/3299 15/32 NoC3x3-PT-6B-LTLFireability-10 2073070 m, 15814 m/sec, 19361863 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/3299 16/32 NoC3x3-PT-6B-LTLFireability-10 2146709 m, 14727 m/sec, 20218850 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/3299 16/32 NoC3x3-PT-6B-LTLFireability-10 2233173 m, 17292 m/sec, 21063259 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/3299 17/32 NoC3x3-PT-6B-LTLFireability-10 2319324 m, 17230 m/sec, 21914478 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 135/3299 18/32 NoC3x3-PT-6B-LTLFireability-10 2411938 m, 18522 m/sec, 22752786 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 140/3299 18/32 NoC3x3-PT-6B-LTLFireability-10 2497559 m, 17124 m/sec, 23597679 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 145/3299 19/32 NoC3x3-PT-6B-LTLFireability-10 2588505 m, 18189 m/sec, 24446823 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 150/3299 19/32 NoC3x3-PT-6B-LTLFireability-10 2682778 m, 18854 m/sec, 25292713 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 155/3299 20/32 NoC3x3-PT-6B-LTLFireability-10 2770959 m, 17636 m/sec, 26131504 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 160/3299 21/32 NoC3x3-PT-6B-LTLFireability-10 2857272 m, 17262 m/sec, 26976594 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 165/3299 21/32 NoC3x3-PT-6B-LTLFireability-10 2949095 m, 18364 m/sec, 27820030 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 170/3299 22/32 NoC3x3-PT-6B-LTLFireability-10 3037747 m, 17730 m/sec, 28654362 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 175/3299 22/32 NoC3x3-PT-6B-LTLFireability-10 3118159 m, 16082 m/sec, 29476168 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 180/3299 23/32 NoC3x3-PT-6B-LTLFireability-10 3199269 m, 16222 m/sec, 30310188 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 185/3299 24/32 NoC3x3-PT-6B-LTLFireability-10 3279017 m, 15949 m/sec, 31149399 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 190/3299 24/32 NoC3x3-PT-6B-LTLFireability-10 3362831 m, 16762 m/sec, 31989359 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 195/3299 25/32 NoC3x3-PT-6B-LTLFireability-10 3440293 m, 15492 m/sec, 32830275 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 200/3299 25/32 NoC3x3-PT-6B-LTLFireability-10 3515246 m, 14990 m/sec, 33630519 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 205/3299 26/32 NoC3x3-PT-6B-LTLFireability-10 3596575 m, 16265 m/sec, 34452085 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 210/3299 26/32 NoC3x3-PT-6B-LTLFireability-10 3671704 m, 15025 m/sec, 35273924 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 215/3299 27/32 NoC3x3-PT-6B-LTLFireability-10 3747294 m, 15118 m/sec, 36111539 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 220/3299 27/32 NoC3x3-PT-6B-LTLFireability-10 3819935 m, 14528 m/sec, 36945918 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 225/3299 28/32 NoC3x3-PT-6B-LTLFireability-10 3892183 m, 14449 m/sec, 37780043 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 230/3299 28/32 NoC3x3-PT-6B-LTLFireability-10 3964114 m, 14386 m/sec, 38611800 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 235/3299 29/32 NoC3x3-PT-6B-LTLFireability-10 4033936 m, 13964 m/sec, 39462125 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 240/3299 29/32 NoC3x3-PT-6B-LTLFireability-10 4105143 m, 14241 m/sec, 40304017 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 245/3299 30/32 NoC3x3-PT-6B-LTLFireability-10 4184343 m, 15840 m/sec, 41138886 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 250/3299 30/32 NoC3x3-PT-6B-LTLFireability-10 4270225 m, 17176 m/sec, 41997864 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 255/3299 31/32 NoC3x3-PT-6B-LTLFireability-10 4366065 m, 19168 m/sec, 42853060 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 260/3299 32/32 NoC3x3-PT-6B-LTLFireability-10 4450572 m, 16901 m/sec, 43706831 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 265/3299 32/32 NoC3x3-PT-6B-LTLFireability-10 4526792 m, 15244 m/sec, 44560843 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6B-LTLFireability-03: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-10: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-6B-LTLFireability-03: LTL unknown AGGR
NoC3x3-PT-6B-LTLFireability-10: LTL unknown AGGR
NoC3x3-PT-6B-LTLFireability-12: LTL unknown AGGR


Time elapsed: 571 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-6B"
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-6B, 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-167863538100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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