fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r167-tall-167838853500707
Last Updated
May 14, 2023

About the Execution of LoLa+red for FunctionPointer-PT-b128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
322.256 10476.00 21285.00 319.10 FFFFTFFFFTFFFTFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853500707.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 FunctionPointer-PT-b128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500707
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678508598038

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:23:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 04:23:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:23:19] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-11 04:23:19] [INFO ] Transformed 306 places.
[2023-03-11 04:23:19] [INFO ] Transformed 840 transitions.
[2023-03-11 04:23:19] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 33 place count 189 transition count 508
Iterating global reduction 1 with 24 rules applied. Total rules applied 57 place count 189 transition count 508
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 91 place count 189 transition count 474
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 105 place count 175 transition count 446
Iterating global reduction 2 with 14 rules applied. Total rules applied 119 place count 175 transition count 446
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 127 place count 175 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 132 place count 170 transition count 428
Iterating global reduction 3 with 5 rules applied. Total rules applied 137 place count 170 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 167 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 167 transition count 416
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 165 transition count 412
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 165 transition count 412
Applied a total of 147 rules in 63 ms. Remains 165 /222 variables (removed 57) and now considering 412/648 (removed 236) transitions.
[2023-03-11 04:23:19] [INFO ] Flow matrix only has 282 transitions (discarded 130 similar events)
// Phase 1: matrix 282 rows 165 cols
[2023-03-11 04:23:20] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-11 04:23:20] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-11 04:23:20] [INFO ] Flow matrix only has 282 transitions (discarded 130 similar events)
[2023-03-11 04:23:20] [INFO ] Invariant cache hit.
[2023-03-11 04:23:20] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 04:23:20] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-11 04:23:20] [INFO ] Flow matrix only has 282 transitions (discarded 130 similar events)
[2023-03-11 04:23:20] [INFO ] Invariant cache hit.
[2023-03-11 04:23:20] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 412/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 165/222 places, 412/648 transitions.
Support contains 20 out of 165 places after structural reductions.
[2023-03-11 04:23:20] [INFO ] Flatten gal took : 55 ms
[2023-03-11 04:23:20] [INFO ] Flatten gal took : 23 ms
[2023-03-11 04:23:20] [INFO ] Input system was already deterministic with 412 transitions.
Incomplete random walk after 10037 steps, including 5 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 04:23:21] [INFO ] Flow matrix only has 282 transitions (discarded 130 similar events)
[2023-03-11 04:23:21] [INFO ] Invariant cache hit.
[2023-03-11 04:23:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:23:21] [INFO ] After 86ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-11 04:23:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 04:23:21] [INFO ] After 29ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:23:21] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:23:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:21] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 04:23:21] [INFO ] After 44ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:23:21] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-11 04:23:22] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 412/412 transitions.
Graph (complete) has 660 edges and 165 vertex of which 143 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 143 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 136 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 136 transition count 352
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 136 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 132 transition count 338
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 132 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 128 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 128 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 124 transition count 308
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 124 transition count 308
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 91 place count 120 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 95 place count 120 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 99 place count 116 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 116 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 107 place count 112 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 111 place count 112 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 115 place count 108 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 119 place count 108 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 104 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 104 transition count 264
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 103 transition count 262
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 103 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 102 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 102 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 101 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 101 transition count 258
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 141 place count 101 transition count 250
Applied a total of 141 rules in 69 ms. Remains 101 /165 variables (removed 64) and now considering 250/412 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 101/165 places, 250/412 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 04:23:22] [INFO ] Flow matrix only has 161 transitions (discarded 89 similar events)
// Phase 1: matrix 161 rows 101 cols
[2023-03-11 04:23:22] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 04:23:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:23:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:22] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 04:23:22] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-11 04:23:22] [INFO ] After 11ms SMT Verify possible using 27 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:23:22] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 04:23:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:23:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:23:22] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 04:23:22] [INFO ] After 8ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 04:23:22] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 04:23:22] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 250/250 transitions.
Graph (complete) has 428 edges and 101 vertex of which 98 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 96 transition count 238
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 96 transition count 238
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 94 transition count 232
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 94 transition count 232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 92 transition count 228
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 92 transition count 228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 90 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 90 transition count 222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 88 transition count 218
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 88 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 86 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 86 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 84 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 83 transition count 208
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 82 transition count 206
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 82 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 81 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 81 transition count 204
Applied a total of 41 rules in 29 ms. Remains 81 /101 variables (removed 20) and now considering 204/250 (removed 46) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 81/101 places, 204/250 transitions.
Finished random walk after 912 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=456 )
FORMULA FunctionPointer-PT-b128-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 884 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 156 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 150 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 150 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 144 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 144 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 138 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 138 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 132 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 132 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 111 transition count 268
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 110 transition count 266
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 110 transition count 262
Applied a total of 120 rules in 49 ms. Remains 110 /165 variables (removed 55) and now considering 262/412 (removed 150) transitions.
[2023-03-11 04:23:22] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 110 cols
[2023-03-11 04:23:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:22] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 04:23:22] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 04:23:22] [INFO ] Invariant cache hit.
[2023-03-11 04:23:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 04:23:22] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-11 04:23:22] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 04:23:22] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 04:23:22] [INFO ] Invariant cache hit.
[2023-03-11 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/165 places, 262/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 110/165 places, 262/412 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s38 s101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-00 finished in 582 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(G(p0))))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 154 transition count 386
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 154 transition count 386
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 154 transition count 380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 147 transition count 360
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 147 transition count 360
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 140 transition count 338
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 140 transition count 338
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 133 transition count 314
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 133 transition count 314
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 126 transition count 298
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 126 transition count 298
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 119 transition count 282
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 119 transition count 282
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 112 transition count 266
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 106 transition count 254
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 106 transition count 254
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 101 transition count 244
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 98 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 97 transition count 236
Applied a total of 141 rules in 28 ms. Remains 97 /165 variables (removed 68) and now considering 236/412 (removed 176) transitions.
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2023-03-11 04:23:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:23] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 04:23:23] [INFO ] Invariant cache hit.
[2023-03-11 04:23:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 04:23:23] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2023-03-11 04:23:23] [INFO ] Invariant cache hit.
[2023-03-11 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/165 places, 236/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 97/165 places, 236/412 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-02 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:(GT 1 s50)], 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 198 steps with 1 reset in 5 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-02 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((p0||X(p1))))&&F(!p1))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 412
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 155 transition count 388
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 155 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 155 transition count 382
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 149 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 143 transition count 348
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 143 transition count 348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 137 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 131 transition count 312
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 119 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 114 transition count 274
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 109 transition count 264
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 105 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 105 transition count 256
Applied a total of 125 rules in 20 ms. Remains 105 /165 variables (removed 60) and now considering 256/412 (removed 156) transitions.
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2023-03-11 04:23:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:23] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-11 04:23:23] [INFO ] Invariant cache hit.
[2023-03-11 04:23:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:23] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-11 04:23:23] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-11 04:23:23] [INFO ] Invariant cache hit.
[2023-03-11 04:23:23] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/165 places, 256/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 105/165 places, 256/412 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s92 s44), p0:(LEQ 1 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-05 finished in 497 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 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Graph (complete) has 884 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 155 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 155 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 23 place count 155 transition count 384
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 148 transition count 364
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 148 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 141 transition count 342
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 141 transition count 342
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 134 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 134 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 127 transition count 302
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 127 transition count 302
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 120 transition count 286
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 120 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 113 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 113 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 113 place count 107 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 119 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 123 place count 103 transition count 250
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 129 place count 101 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 131 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 100 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 99 transition count 240
Applied a total of 137 rules in 49 ms. Remains 99 /165 variables (removed 66) and now considering 240/412 (removed 172) transitions.
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2023-03-11 04:23:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 04:23:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 04:23:24] [INFO ] Invariant cache hit.
[2023-03-11 04:23:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 04:23:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 04:23:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2023-03-11 04:23:24] [INFO ] Invariant cache hit.
[2023-03-11 04:23:24] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/165 places, 240/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 99/165 places, 240/412 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s73)], 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 75 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-07 finished in 407 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) U G(p1)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Graph (complete) has 884 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 155 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 155 transition count 388
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 25 place count 155 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 149 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 149 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 143 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 143 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 137 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 137 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 131 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 131 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 125 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 91 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 102 place count 114 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 107 place count 114 transition count 274
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 111 place count 110 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 115 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 106 transition count 254
Applied a total of 127 rules in 42 ms. Remains 106 /165 variables (removed 59) and now considering 254/412 (removed 158) transitions.
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-11 04:23:24] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 04:23:24] [INFO ] Invariant cache hit.
[2023-03-11 04:23:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:24] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 04:23:24] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 04:23:24] [INFO ] Invariant cache hit.
[2023-03-11 04:23:24] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 254/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 106/165 places, 254/412 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s103), p0:(GT 3 s87)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-08 finished in 415 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||(p1&&G(p2)&&X(F(!p1))))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 157 transition count 394
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 157 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 157 transition count 390
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 152 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 147 transition count 362
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 147 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 142 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 138 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 134 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 134 transition count 326
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 130 transition count 318
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 130 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 127 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 127 transition count 312
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 82 place count 124 transition count 306
Iterating global reduction 2 with 3 rules applied. Total rules applied 85 place count 124 transition count 306
Applied a total of 85 rules in 13 ms. Remains 124 /165 variables (removed 41) and now considering 306/412 (removed 106) transitions.
[2023-03-11 04:23:24] [INFO ] Flow matrix only has 209 transitions (discarded 97 similar events)
// Phase 1: matrix 209 rows 124 cols
[2023-03-11 04:23:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 04:23:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 04:23:25] [INFO ] Flow matrix only has 209 transitions (discarded 97 similar events)
[2023-03-11 04:23:25] [INFO ] Invariant cache hit.
[2023-03-11 04:23:25] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-11 04:23:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-11 04:23:25] [INFO ] Flow matrix only has 209 transitions (discarded 97 similar events)
[2023-03-11 04:23:25] [INFO ] Invariant cache hit.
[2023-03-11 04:23:25] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/165 places, 306/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 124/165 places, 306/412 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p2), (NOT p0), (OR (NOT p2) p1), true, (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(GT s110 s78), p0:(GT 3 s112), p1:(LEQ 2 s108)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLCardinality-09 finished in 1164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Graph (complete) has 884 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 154 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 154 transition count 386
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 27 place count 154 transition count 380
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 148 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 148 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 142 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 136 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 136 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 130 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 130 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 124 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 124 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 109 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 105 transition count 256
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 129 place count 105 transition count 252
Applied a total of 129 rules in 49 ms. Remains 105 /165 variables (removed 60) and now considering 252/412 (removed 160) transitions.
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2023-03-11 04:23:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 04:23:26] [INFO ] Invariant cache hit.
[2023-03-11 04:23:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 04:23:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 04:23:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 04:23:26] [INFO ] Invariant cache hit.
[2023-03-11 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/165 places, 252/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 105/165 places, 252/412 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s92)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-11 finished in 402 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||X((p1 U p2)))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 412
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 156 transition count 392
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 156 transition count 386
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 151 transition count 374
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 151 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 146 transition count 356
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 141 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 58 place count 136 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 63 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 131 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 126 transition count 304
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 121 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 121 transition count 294
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 117 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 116 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 116 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 115 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 115 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 114 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 114 transition count 280
Applied a total of 107 rules in 26 ms. Remains 114 /165 variables (removed 51) and now considering 280/412 (removed 132) transitions.
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 191 transitions (discarded 89 similar events)
// Phase 1: matrix 191 rows 114 cols
[2023-03-11 04:23:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:23:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 191 transitions (discarded 89 similar events)
[2023-03-11 04:23:26] [INFO ] Invariant cache hit.
[2023-03-11 04:23:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-11 04:23:26] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-11 04:23:26] [INFO ] Flow matrix only has 191 transitions (discarded 89 similar events)
[2023-03-11 04:23:26] [INFO ] Invariant cache hit.
[2023-03-11 04:23:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/165 places, 280/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 114/165 places, 280/412 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s89), p2:(AND (LEQ s103 s57) (LEQ 2 s89))], 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 101 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-14 finished in 556 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(G(p0))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 412/412 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 412
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 155 transition count 388
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 155 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 155 transition count 384
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 148 transition count 364
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 148 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 44 place count 141 transition count 342
Iterating global reduction 2 with 7 rules applied. Total rules applied 51 place count 141 transition count 342
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 134 transition count 318
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 134 transition count 318
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 127 transition count 302
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 127 transition count 302
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 120 transition count 286
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 120 transition count 286
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 113 transition count 270
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 113 transition count 270
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 107 transition count 258
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 107 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 103 transition count 250
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 101 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 100 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 99 transition count 242
Applied a total of 135 rules in 21 ms. Remains 99 /165 variables (removed 66) and now considering 242/412 (removed 170) transitions.
[2023-03-11 04:23:27] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2023-03-11 04:23:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 04:23:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 04:23:27] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-11 04:23:27] [INFO ] Invariant cache hit.
[2023-03-11 04:23:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 04:23:27] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 04:23:27] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-11 04:23:27] [INFO ] Invariant cache hit.
[2023-03-11 04:23:27] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/165 places, 242/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 99/165 places, 242/412 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-15 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:(AND (GT s73 s38) (GT 1 s48))], 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 0 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-15 finished in 406 ms.
All properties solved by simple procedures.
Total runtime 8052 ms.
ITS solved all properties within timeout

BK_STOP 1678508608514

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="FunctionPointer-PT-b128"
export BK_EXAMINATION="LTLCardinality"
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 FunctionPointer-PT-b128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853500707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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