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-167838853400683.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-b016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853400683
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 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-b016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678504982873

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-b016
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:23:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:23:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:23:04] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-11 03:23:04] [INFO ] Transformed 306 places.
[2023-03-11 03:23:04] [INFO ] Transformed 840 transitions.
[2023-03-11 03:23:04] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 149 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 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 31 place count 191 transition count 526
Iterating global reduction 1 with 22 rules applied. Total rules applied 53 place count 191 transition count 526
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 95 place count 191 transition count 484
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 184 transition count 470
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 184 transition count 470
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 121 place count 184 transition count 458
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 182 transition count 454
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 182 transition count 454
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 180 transition count 446
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 180 transition count 446
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 179 transition count 444
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 179 transition count 444
Applied a total of 131 rules in 61 ms. Remains 179 /222 variables (removed 43) and now considering 444/648 (removed 204) transitions.
[2023-03-11 03:23:04] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
// Phase 1: matrix 304 rows 179 cols
[2023-03-11 03:23:04] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-11 03:23:04] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-11 03:23:04] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-11 03:23:04] [INFO ] Invariant cache hit.
[2023-03-11 03:23:04] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-11 03:23:05] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2023-03-11 03:23:05] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-11 03:23:05] [INFO ] Invariant cache hit.
[2023-03-11 03:23:05] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/222 places, 444/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 179/222 places, 444/648 transitions.
Support contains 24 out of 179 places after structural reductions.
[2023-03-11 03:23:05] [INFO ] Flatten gal took : 54 ms
[2023-03-11 03:23:05] [INFO ] Flatten gal took : 28 ms
[2023-03-11 03:23:05] [INFO ] Input system was already deterministic with 444 transitions.
Incomplete random walk after 10006 steps, including 5 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 5) seen :2
Running SMT prover for 3 properties.
[2023-03-11 03:23:05] [INFO ] Flow matrix only has 304 transitions (discarded 140 similar events)
[2023-03-11 03:23:05] [INFO ] Invariant cache hit.
[2023-03-11 03:23:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:05] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:23:06] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2023-03-11 03:23:06] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-11 03:23:06] [INFO ] After 29ms SMT Verify possible using 63 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:23:06] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-11 03:23:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-11 03:23:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:23:06] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-11 03:23:06] [INFO ] After 23ms SMT Verify possible using 63 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-11 03:23:06] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 03:23:06] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 713 edges and 179 vertex of which 154 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 154 transition count 396
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 144 transition count 374
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 144 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 144 transition count 368
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 81 place count 138 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 138 transition count 356
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 93 place count 132 transition count 338
Iterating global reduction 2 with 6 rules applied. Total rules applied 99 place count 132 transition count 338
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 105 place count 126 transition count 318
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 126 transition count 318
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 120 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 120 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 115 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 115 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 110 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 110 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 105 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 105 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 100 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 100 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 167 place count 96 transition count 242
Iterating global reduction 2 with 4 rules applied. Total rules applied 171 place count 96 transition count 242
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 175 place count 92 transition count 234
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 92 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 90 transition count 230
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 90 transition count 230
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 90 transition count 224
Applied a total of 189 rules in 67 ms. Remains 90 /179 variables (removed 89) and now considering 224/444 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 90/179 places, 224/444 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 03:23:06] [INFO ] Flow matrix only has 139 transitions (discarded 85 similar events)
// Phase 1: matrix 139 rows 90 cols
[2023-03-11 03:23:06] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-11 03:23:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:06] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:23:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-11 03:23:06] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:06] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:06] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:06] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:06] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:23:06] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 224/224 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 89 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 89 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 88 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 88 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 87 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 87 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 86 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 86 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 83 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 83 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 206
Applied a total of 16 rules in 20 ms. Remains 82 /90 variables (removed 8) and now considering 206/224 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 82/90 places, 206/224 transitions.
Finished random walk after 7044 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=640 )
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b016-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 161 transition count 402
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 161 transition count 402
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 155 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 155 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 149 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 149 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 143 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 143 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 137 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 93 place count 131 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 99 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 105 place count 125 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 111 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 117 place count 119 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 123 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 127 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 131 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 135 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 111 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 108 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 108 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 108 transition count 260
Applied a total of 149 rules in 67 ms. Remains 108 /179 variables (removed 71) and now considering 260/444 (removed 184) transitions.
[2023-03-11 03:23:06] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2023-03-11 03:23:06] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:07] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-11 03:23:07] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:07] [INFO ] Invariant cache hit.
[2023-03-11 03:23:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 03:23:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-11 03:23:07] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 03:23:07] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:07] [INFO ] Invariant cache hit.
[2023-03-11 03:23:07] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/179 places, 260/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 108/179 places, 260/444 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-00 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 s97 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 550 reset in 388 ms.
Product exploration explored 100000 steps with 549 reset in 370 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 3672 steps, including 5 resets, run visited all 1 properties in 10 ms. (steps per millisecond=367 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 14 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 03:23:08] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:08] [INFO ] Invariant cache hit.
[2023-03-11 03:23:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 03:23:08] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:08] [INFO ] Invariant cache hit.
[2023-03-11 03:23:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 03:23:08] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-11 03:23:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 03:23:08] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:08] [INFO ] Invariant cache hit.
[2023-03-11 03:23:08] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 108/108 places, 260/260 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 310 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=155 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 574 reset in 255 ms.
Product exploration explored 100000 steps with 629 reset in 271 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2023-03-11 03:23:09] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:09] [INFO ] Invariant cache hit.
[2023-03-11 03:23:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 03:23:09] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:09] [INFO ] Invariant cache hit.
[2023-03-11 03:23:09] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-11 03:23:10] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-11 03:23:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-11 03:23:10] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
[2023-03-11 03:23:10] [INFO ] Invariant cache hit.
[2023-03-11 03:23:10] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 108/108 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-00 finished in 3310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1 U p2))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 171 transition count 428
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 171 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 24 place count 171 transition count 420
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 168 transition count 414
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 168 transition count 414
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 165 transition count 406
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 165 transition count 406
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 162 transition count 396
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 162 transition count 396
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 159 transition count 388
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 159 transition count 388
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 156 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 156 transition count 376
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 153 transition count 366
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 153 transition count 366
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 150 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 150 transition count 360
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 147 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 147 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 144 transition count 348
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 144 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 141 transition count 342
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 141 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 139 transition count 338
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 139 transition count 338
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 98 place count 139 transition count 328
Applied a total of 98 rules in 51 ms. Remains 139 /179 variables (removed 40) and now considering 328/444 (removed 116) transitions.
[2023-03-11 03:23:10] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
// Phase 1: matrix 226 rows 139 cols
[2023-03-11 03:23:10] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:10] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 03:23:10] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:10] [INFO ] Invariant cache hit.
[2023-03-11 03:23:10] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 03:23:10] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-11 03:23:10] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 03:23:10] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:10] [INFO ] Invariant cache hit.
[2023-03-11 03:23:10] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/179 places, 328/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 412 ms. Remains : 139/179 places, 328/444 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 s109), p2:(LEQ s110 0), p1:(LEQ s130 s126)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 571 reset in 365 ms.
Product exploration explored 100000 steps with 562 reset in 352 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 740 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 662 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10010 steps, including 13 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:23:12] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:12] [INFO ] Invariant cache hit.
[2023-03-11 03:23:12] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:23:12] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:12] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 03:23:12] [INFO ] After 25ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:12] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 03:23:12] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 328/328 transitions.
Graph (complete) has 552 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 115 transition count 280
Applied a total of 49 rules in 6 ms. Remains 115 /139 variables (removed 24) and now considering 280/328 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/139 places, 280/328 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 448412 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448412 steps, saw 292266 distinct states, run finished after 3002 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:23:15] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
// Phase 1: matrix 180 rows 115 cols
[2023-03-11 03:23:15] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:23:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:15] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:15] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 03:23:15] [INFO ] After 22ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:15] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 03:23:15] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 115/115 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-11 03:23:15] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:16] [INFO ] Invariant cache hit.
[2023-03-11 03:23:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 03:23:16] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:16] [INFO ] Invariant cache hit.
[2023-03-11 03:23:16] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 03:23:16] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-11 03:23:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:16] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:16] [INFO ] Invariant cache hit.
[2023-03-11 03:23:16] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 115/115 places, 280/280 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 115 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 105 transition count 170
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 120 place count 105 transition count 144
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 172 place count 79 transition count 144
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 206 place count 62 transition count 127
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 55 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 227 place count 48 transition count 99
Iterating global reduction 2 with 7 rules applied. Total rules applied 234 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 41 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 41 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 255 place count 41 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 255 place count 41 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 40 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 267 place count 35 transition count 77
Applied a total of 267 rules in 16 ms. Remains 35 /115 variables (removed 80) and now considering 77/280 (removed 203) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 77 rows 35 cols
[2023-03-11 03:23:16] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:23:16] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 03:23:16] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:23:16] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:16] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 03:23:16] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p2 p1), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 627 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 328/328 transitions.
Applied a total of 0 rules in 13 ms. Remains 139 /139 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2023-03-11 03:23:17] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
// Phase 1: matrix 226 rows 139 cols
[2023-03-11 03:23:17] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-11 03:23:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 03:23:17] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:17] [INFO ] Invariant cache hit.
[2023-03-11 03:23:17] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 03:23:17] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-11 03:23:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 03:23:17] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:17] [INFO ] Invariant cache hit.
[2023-03-11 03:23:17] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 139/139 places, 328/328 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 740 edges and 139 vertex of which 138 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 p1 p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 497 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:23:18] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:18] [INFO ] Invariant cache hit.
[2023-03-11 03:23:18] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:23:18] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 03:23:18] [INFO ] After 26ms SMT Verify possible using 51 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:18] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 03:23:18] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 328/328 transitions.
Graph (complete) has 552 edges and 139 vertex of which 115 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 115 transition count 280
Applied a total of 49 rules in 12 ms. Remains 115 /139 variables (removed 24) and now considering 280/328 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 115/139 places, 280/328 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 537211 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 537211 steps, saw 347538 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:23:21] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
// Phase 1: matrix 180 rows 115 cols
[2023-03-11 03:23:21] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-11 03:23:21] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 03:23:21] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:21] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 03:23:21] [INFO ] After 22ms SMT Verify possible using 29 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:21] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 03:23:22] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 280/280 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2023-03-11 03:23:22] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:22] [INFO ] Invariant cache hit.
[2023-03-11 03:23:22] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 03:23:22] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:22] [INFO ] Invariant cache hit.
[2023-03-11 03:23:22] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 03:23:22] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-11 03:23:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:22] [INFO ] Flow matrix only has 180 transitions (discarded 100 similar events)
[2023-03-11 03:23:22] [INFO ] Invariant cache hit.
[2023-03-11 03:23:22] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 115/115 places, 280/280 transitions.
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 115 transition count 170
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 120 place count 105 transition count 170
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 120 place count 105 transition count 144
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 172 place count 79 transition count 144
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 206 place count 62 transition count 127
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 213 place count 55 transition count 113
Iterating global reduction 2 with 7 rules applied. Total rules applied 220 place count 55 transition count 113
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 227 place count 48 transition count 99
Iterating global reduction 2 with 7 rules applied. Total rules applied 234 place count 48 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 241 place count 41 transition count 85
Iterating global reduction 2 with 7 rules applied. Total rules applied 248 place count 41 transition count 85
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 255 place count 41 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 255 place count 41 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 257 place count 40 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 267 place count 35 transition count 77
Applied a total of 267 rules in 11 ms. Remains 35 /115 variables (removed 80) and now considering 77/280 (removed 203) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 77 rows 35 cols
[2023-03-11 03:23:22] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-11 03:23:22] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:23:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-11 03:23:22] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:23:22] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:23:22] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 03:23:22] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (OR p0 p1 p2)), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p1 p2)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 12 factoid took 434 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 562 reset in 327 ms.
Product exploration explored 100000 steps with 593 reset in 352 ms.
Support contains 4 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 328/328 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 328/328 (removed 0) transitions.
[2023-03-11 03:23:23] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
// Phase 1: matrix 226 rows 139 cols
[2023-03-11 03:23:23] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-11 03:23:23] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-11 03:23:23] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:23] [INFO ] Invariant cache hit.
[2023-03-11 03:23:23] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-11 03:23:24] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-11 03:23:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 226 transitions (discarded 102 similar events)
[2023-03-11 03:23:24] [INFO ] Invariant cache hit.
[2023-03-11 03:23:24] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 139/139 places, 328/328 transitions.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-01 finished in 14077 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 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 160 transition count 400
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 160 transition count 400
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 154 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 154 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 59 place count 148 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 65 place count 148 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 71 place count 142 transition count 346
Iterating global reduction 1 with 6 rules applied. Total rules applied 77 place count 142 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 136 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 136 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 130 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 135 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 140 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 145 place count 108 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 105 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 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 155 place count 105 transition count 252
Applied a total of 155 rules in 46 ms. Remains 105 /179 variables (removed 74) and now considering 252/444 (removed 192) transitions.
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2023-03-11 03:23:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:23:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 03:23:24] [INFO ] Invariant cache hit.
[2023-03-11 03:23:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:23:24] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-11 03:23:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2023-03-11 03:23:24] [INFO ] Invariant cache hit.
[2023-03-11 03:23:24] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/179 places, 252/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 105/179 places, 252/444 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s85 s103)], 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 166 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-02 finished in 362 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((p0||X((G(p1)||X(p0))))) U (p0&&X((p0||X((G(p1)||X(p0)))))))))'
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 167 transition count 416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 32 place count 160 transition count 402
Iterating global reduction 2 with 7 rules applied. Total rules applied 39 place count 160 transition count 402
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 46 place count 153 transition count 380
Iterating global reduction 2 with 7 rules applied. Total rules applied 53 place count 153 transition count 380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 60 place count 146 transition count 356
Iterating global reduction 2 with 7 rules applied. Total rules applied 67 place count 146 transition count 356
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 139 transition count 338
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 139 transition count 338
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 132 transition count 314
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 132 transition count 314
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 102 place count 125 transition count 294
Iterating global reduction 2 with 7 rules applied. Total rules applied 109 place count 125 transition count 294
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 116 place count 118 transition count 280
Iterating global reduction 2 with 7 rules applied. Total rules applied 123 place count 118 transition count 280
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 130 place count 111 transition count 266
Iterating global reduction 2 with 7 rules applied. Total rules applied 137 place count 111 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 142 place count 106 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 147 place count 106 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 101 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 101 transition count 246
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 98 transition count 240
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 98 transition count 240
Applied a total of 163 rules in 23 ms. Remains 98 /179 variables (removed 81) and now considering 240/444 (removed 204) transitions.
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2023-03-11 03:23:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:23:24] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2023-03-11 03:23:24] [INFO ] Invariant cache hit.
[2023-03-11 03:23:24] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 03:23:24] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-11 03:23:24] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
[2023-03-11 03:23:24] [INFO ] Invariant cache hit.
[2023-03-11 03:23:24] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/179 places, 240/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 98/179 places, 240/444 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 2 s23), p1:(LEQ s80 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 145 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-09 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((p1 U p2)))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 168 transition count 420
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 168 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 168 transition count 418
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 161 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 161 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 155 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 155 transition count 386
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 149 transition count 366
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 149 transition count 366
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 143 transition count 350
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 131 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 131 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 119 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 119 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 114 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 114 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 109 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 107 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 107 transition count 262
Applied a total of 145 rules in 32 ms. Remains 107 /179 variables (removed 72) and now considering 262/444 (removed 182) transitions.
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2023-03-11 03:23:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:25] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-11 03:23:25] [INFO ] Invariant cache hit.
[2023-03-11 03:23:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:25] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2023-03-11 03:23:25] [INFO ] Invariant cache hit.
[2023-03-11 03:23:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/179 places, 262/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 107/179 places, 262/444 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(LEQ 3 s74), p1:(GT s57 s94), p0:(LEQ 1 s10)], 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 1072 steps with 0 reset in 9 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-12 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&F(p0)))))'
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 161 transition count 402
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 161 transition count 402
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 156 transition count 386
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 156 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 151 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 151 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 146 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 141 transition count 340
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 83 place count 137 transition count 330
Iterating global reduction 1 with 4 rules applied. Total rules applied 87 place count 137 transition count 330
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 91 place count 133 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 95 place count 133 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 99 place count 129 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 103 place count 129 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 127 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 127 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 125 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 125 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 124 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 124 transition count 304
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 121 place count 124 transition count 296
Applied a total of 121 rules in 41 ms. Remains 124 /179 variables (removed 55) and now considering 296/444 (removed 148) transitions.
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
// Phase 1: matrix 205 rows 124 cols
[2023-03-11 03:23:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
[2023-03-11 03:23:25] [INFO ] Invariant cache hit.
[2023-03-11 03:23:25] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-11 03:23:25] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-11 03:23:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:25] [INFO ] Flow matrix only has 205 transitions (discarded 91 similar events)
[2023-03-11 03:23:25] [INFO ] Invariant cache hit.
[2023-03-11 03:23:26] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/179 places, 296/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 124/179 places, 296/444 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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=[p1:(GT s47 s93), p0:(LEQ s107 s115)], 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 20728 steps with 196 reset in 63 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-13 finished in 515 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 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Graph (complete) has 953 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 166 transition count 416
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 166 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 29 place count 166 transition count 412
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 159 transition count 398
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 159 transition count 398
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 152 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 145 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 145 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 78 place count 138 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 85 place count 138 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 92 place count 131 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 99 place count 131 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 106 place count 124 transition count 290
Iterating global reduction 1 with 7 rules applied. Total rules applied 113 place count 124 transition count 290
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 120 place count 117 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 127 place count 117 transition count 276
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 134 place count 110 transition count 262
Iterating global reduction 1 with 7 rules applied. Total rules applied 141 place count 110 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 146 place count 105 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 151 place count 105 transition count 252
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 156 place count 100 transition count 242
Iterating global reduction 1 with 5 rules applied. Total rules applied 161 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 164 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 167 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 169 place count 97 transition count 234
Applied a total of 169 rules in 36 ms. Remains 97 /179 variables (removed 82) and now considering 234/444 (removed 210) transitions.
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 03:23:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:26] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:23:26] [INFO ] Invariant cache hit.
[2023-03-11 03:23:26] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 03:23:26] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-11 03:23:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:23:26] [INFO ] Invariant cache hit.
[2023-03-11 03:23:26] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/179 places, 234/444 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 97/179 places, 234/444 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-14 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 s37)], 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 355 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b016-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLCardinality-14 finished in 350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)||(p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(p2)))))))))))'
Support contains 5 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 444/444 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 178 transition count 444
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 167 transition count 418
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 167 transition count 418
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 167 transition count 414
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 160 transition count 400
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 160 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 48 place count 153 transition count 378
Iterating global reduction 2 with 7 rules applied. Total rules applied 55 place count 153 transition count 378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 146 transition count 354
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 146 transition count 354
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 139 transition count 336
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 139 transition count 336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 133 transition count 316
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 127 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 127 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 113 place count 121 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 119 place count 121 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 116 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 116 transition count 278
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 113 transition count 272
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 113 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 110 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 108 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 108 transition count 262
Applied a total of 145 rules in 23 ms. Remains 108 /179 variables (removed 71) and now considering 262/444 (removed 182) transitions.
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 108 cols
[2023-03-11 03:23:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:23:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:26] [INFO ] Invariant cache hit.
[2023-03-11 03:23:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:26] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 03:23:26] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:26] [INFO ] Invariant cache hit.
[2023-03-11 03:23:26] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/179 places, 262/444 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 108/179 places, 262/444 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p0), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p0:(GT 3 s88), p2:(GT s77 s21), p1:(GT s22 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 188 ms.
Product exploration explored 100000 steps with 20000 reset in 193 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/108 stabilizing places and 64/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10015 steps, including 8 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:23:28] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:28] [INFO ] Invariant cache hit.
[2023-03-11 03:23:28] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:23:28] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:28] [INFO ] After 10ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:28] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 03:23:28] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 262/262 transitions.
Graph (complete) has 439 edges and 108 vertex of which 84 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 84 transition count 214
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 84 transition count 210
Applied a total of 53 rules in 7 ms. Remains 84 /108 variables (removed 24) and now considering 210/262 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 84/108 places, 210/262 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1879475 steps, run timeout after 3001 ms. (steps per millisecond=626 ) properties seen :{}
Probabilistic random walk after 1879475 steps, saw 1169896 distinct states, run finished after 3001 ms. (steps per millisecond=626 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:23:31] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
// Phase 1: matrix 131 rows 84 cols
[2023-03-11 03:23:31] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-11 03:23:31] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:31] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 03:23:31] [INFO ] After 11ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:31] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:23:31] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-11 03:23:31] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:31] [INFO ] Invariant cache hit.
[2023-03-11 03:23:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 03:23:31] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:31] [INFO ] Invariant cache hit.
[2023-03-11 03:23:31] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 03:23:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 03:23:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:31] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:31] [INFO ] Invariant cache hit.
[2023-03-11 03:23:31] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 84/84 places, 210/210 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 84 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 78 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 91 place count 78 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 127 place count 60 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 155 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 39 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 39 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 34 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 34 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 30 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 30 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 30 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 28 transition count 63
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 28 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 28 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 27 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 27 transition count 58
Applied a total of 200 rules in 13 ms. Remains 27 /84 variables (removed 57) and now considering 58/210 (removed 152) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 27 cols
[2023-03-11 03:23:31] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 03:23:31] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:31] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:23:31] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:31] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:23:31] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 302 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 470 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 262/262 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-11 03:23:32] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 108 cols
[2023-03-11 03:23:32] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 03:23:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 03:23:32] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:32] [INFO ] Invariant cache hit.
[2023-03-11 03:23:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:33] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-11 03:23:33] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:33] [INFO ] Invariant cache hit.
[2023-03-11 03:23:33] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 108/108 places, 262/262 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Detected a total of 24/108 stabilizing places and 64/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 345 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 03:23:33] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:33] [INFO ] Invariant cache hit.
[2023-03-11 03:23:33] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:23:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:23:33] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:33] [INFO ] After 9ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:33] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 03:23:33] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 262/262 transitions.
Graph (complete) has 439 edges and 108 vertex of which 84 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 84 transition count 214
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 84 transition count 210
Applied a total of 53 rules in 8 ms. Remains 84 /108 variables (removed 24) and now considering 210/262 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 84/108 places, 210/262 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1924024 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1924024 steps, saw 1197624 distinct states, run finished after 3003 ms. (steps per millisecond=640 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:23:36] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
// Phase 1: matrix 131 rows 84 cols
[2023-03-11 03:23:36] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-11 03:23:36] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:37] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 03:23:37] [INFO ] After 11ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:37] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 03:23:37] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-11 03:23:37] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:37] [INFO ] Invariant cache hit.
[2023-03-11 03:23:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 03:23:37] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:37] [INFO ] Invariant cache hit.
[2023-03-11 03:23:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 03:23:37] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-11 03:23:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:23:37] [INFO ] Flow matrix only has 131 transitions (discarded 79 similar events)
[2023-03-11 03:23:37] [INFO ] Invariant cache hit.
[2023-03-11 03:23:37] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 84/84 places, 210/210 transitions.
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 85 rules applied. Total rules applied 85 place count 84 transition count 125
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 91 place count 78 transition count 125
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 91 place count 78 transition count 107
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 127 place count 60 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 155 place count 46 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 162 place count 39 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 169 place count 39 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 34 transition count 69
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 34 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 183 place count 30 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 187 place count 30 transition count 61
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 190 place count 30 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 28 transition count 63
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 28 transition count 60
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 28 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 27 transition count 59
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 200 place count 27 transition count 58
Applied a total of 200 rules in 10 ms. Remains 27 /84 variables (removed 57) and now considering 58/210 (removed 152) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 58 rows 27 cols
[2023-03-11 03:23:37] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 03:23:37] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:23:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-11 03:23:37] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:23:37] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:23:37] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:23:37] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1 p0)), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 401 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 314 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 368 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 150 ms.
Product exploration explored 100000 steps with 20000 reset in 159 ms.
Applying partial POR strategy [true, true, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 353 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 262/262 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 108 transition count 258
Applied a total of 4 rules in 13 ms. Remains 108 /108 variables (removed 0) and now considering 258/262 (removed 4) transitions.
[2023-03-11 03:23:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 03:23:39] [INFO ] Flow matrix only has 177 transitions (discarded 81 similar events)
// Phase 1: matrix 177 rows 108 cols
[2023-03-11 03:23:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:23:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/108 places, 258/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 108/108 places, 258/262 transitions.
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 262/262 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2023-03-11 03:23:39] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
// Phase 1: matrix 179 rows 108 cols
[2023-03-11 03:23:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:23:39] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 03:23:39] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:39] [INFO ] Invariant cache hit.
[2023-03-11 03:23:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-11 03:23:39] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-11 03:23:39] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2023-03-11 03:23:39] [INFO ] Invariant cache hit.
[2023-03-11 03:23:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 108/108 places, 262/262 transitions.
Treatment of property FunctionPointer-PT-b016-LTLCardinality-15 finished in 13437 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(p1 U p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)||(p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(p2)))))))))))'
[2023-03-11 03:23:40] [INFO ] Flatten gal took : 21 ms
[2023-03-11 03:23:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 03:23:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 179 places, 444 transitions and 1786 arcs took 4 ms.
Total runtime 36074 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b016
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA FunctionPointer-PT-b016-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678505186498

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 FunctionPointer-PT-b016-LTLCardinality-15
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for FunctionPointer-PT-b016-LTLCardinality-15
lola: result : true
lola: markings : 167
lola: fired transitions : 290
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-b016-LTLCardinality-01
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 2/32 FunctionPointer-PT-b016-LTLCardinality-01 243335 m, 48667 m/sec, 322764 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 4/32 FunctionPointer-PT-b016-LTLCardinality-01 488939 m, 49120 m/sec, 648565 t fired, .

Time elapsed: 10 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 6/32 FunctionPointer-PT-b016-LTLCardinality-01 735065 m, 49225 m/sec, 975059 t fired, .

Time elapsed: 15 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 8/32 FunctionPointer-PT-b016-LTLCardinality-01 979837 m, 48954 m/sec, 1299757 t fired, .

Time elapsed: 20 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 10/32 FunctionPointer-PT-b016-LTLCardinality-01 1222910 m, 48614 m/sec, 1622201 t fired, .

Time elapsed: 25 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 12/32 FunctionPointer-PT-b016-LTLCardinality-01 1467739 m, 48965 m/sec, 1946974 t fired, .

Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 14/32 FunctionPointer-PT-b016-LTLCardinality-01 1714330 m, 49318 m/sec, 2274084 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 16/32 FunctionPointer-PT-b016-LTLCardinality-01 1959172 m, 48968 m/sec, 2598874 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 18/32 FunctionPointer-PT-b016-LTLCardinality-01 2202901 m, 48745 m/sec, 2922188 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 20/32 FunctionPointer-PT-b016-LTLCardinality-01 2449121 m, 49244 m/sec, 3248807 t fired, .

Time elapsed: 50 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 22/32 FunctionPointer-PT-b016-LTLCardinality-01 2697608 m, 49697 m/sec, 3578432 t fired, .

Time elapsed: 55 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 24/32 FunctionPointer-PT-b016-LTLCardinality-01 2945374 m, 49553 m/sec, 3907102 t fired, .

Time elapsed: 60 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1800 26/32 FunctionPointer-PT-b016-LTLCardinality-01 3192700 m, 49465 m/sec, 4235187 t fired, .

Time elapsed: 65 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1800 28/32 FunctionPointer-PT-b016-LTLCardinality-01 3439528 m, 49365 m/sec, 4562612 t fired, .

Time elapsed: 70 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1800 30/32 FunctionPointer-PT-b016-LTLCardinality-01 3686777 m, 49449 m/sec, 4890595 t fired, .

Time elapsed: 75 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1800 32/32 FunctionPointer-PT-b016-LTLCardinality-01 3932497 m, 49144 m/sec, 5216550 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-b016-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b016-LTLCardinality-00
lola: time limit : 3515 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3515 3/32 FunctionPointer-PT-b016-LTLCardinality-00 258707 m, 51741 m/sec, 343154 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3515 5/32 FunctionPointer-PT-b016-LTLCardinality-00 516992 m, 51657 m/sec, 685777 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3515 7/32 FunctionPointer-PT-b016-LTLCardinality-00 775155 m, 51632 m/sec, 1028238 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3515 9/32 FunctionPointer-PT-b016-LTLCardinality-00 1033236 m, 51616 m/sec, 1370591 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3515 11/32 FunctionPointer-PT-b016-LTLCardinality-00 1290276 m, 51408 m/sec, 1711563 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3515 13/32 FunctionPointer-PT-b016-LTLCardinality-00 1547945 m, 51533 m/sec, 2053368 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3515 15/32 FunctionPointer-PT-b016-LTLCardinality-00 1805574 m, 51525 m/sec, 2395121 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3515 17/32 FunctionPointer-PT-b016-LTLCardinality-00 2063413 m, 51567 m/sec, 2737153 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3515 19/32 FunctionPointer-PT-b016-LTLCardinality-00 2321212 m, 51559 m/sec, 3079132 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3515 21/32 FunctionPointer-PT-b016-LTLCardinality-00 2578709 m, 51499 m/sec, 3420708 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3515 23/32 FunctionPointer-PT-b016-LTLCardinality-00 2836254 m, 51509 m/sec, 3762351 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3515 25/32 FunctionPointer-PT-b016-LTLCardinality-00 3093276 m, 51404 m/sec, 4103297 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3515 27/32 FunctionPointer-PT-b016-LTLCardinality-00 3350277 m, 51400 m/sec, 4444218 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3515 29/32 FunctionPointer-PT-b016-LTLCardinality-00 3606386 m, 51221 m/sec, 4783953 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3515 31/32 FunctionPointer-PT-b016-LTLCardinality-00 3863223 m, 51367 m/sec, 5124657 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b016-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b016-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b016-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLCardinality-00: LTL unknown AGGR
FunctionPointer-PT-b016-LTLCardinality-01: LTL unknown AGGR
FunctionPointer-PT-b016-LTLCardinality-15: LTL true LTL model checker


Time elapsed: 165 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b016"
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-b016, 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-167838853400683"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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