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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
524.983 21764.00 43541.00 560.50 FFTFFTFFFFFFFFF? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838856300708.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is FunctionPointer-PT-b128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838856300708
=====================================================================

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678621989472

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 11:53:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 11:53:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 11:53:11] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-12 11:53:11] [INFO ] Transformed 306 places.
[2023-03-12 11:53:11] [INFO ] Transformed 840 transitions.
[2023-03-12 11:53:11] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 32 place count 190 transition count 568
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 568
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 122 place count 190 transition count 500
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 130 place count 182 transition count 484
Iterating global reduction 2 with 8 rules applied. Total rules applied 138 place count 182 transition count 484
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 150 place count 182 transition count 472
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 156 place count 176 transition count 460
Iterating global reduction 3 with 6 rules applied. Total rules applied 162 place count 176 transition count 460
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 168 place count 170 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 174 place count 170 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 179 place count 165 transition count 426
Iterating global reduction 3 with 5 rules applied. Total rules applied 184 place count 165 transition count 426
Applied a total of 184 rules in 67 ms. Remains 165 /222 variables (removed 57) and now considering 426/648 (removed 222) transitions.
[2023-03-12 11:53:11] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
// Phase 1: matrix 285 rows 165 cols
[2023-03-12 11:53:11] [INFO ] Computed 2 place invariants in 17 ms
[2023-03-12 11:53:11] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-12 11:53:11] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-12 11:53:11] [INFO ] Invariant cache hit.
[2023-03-12 11:53:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 11:53:12] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2023-03-12 11:53:12] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-12 11:53:12] [INFO ] Invariant cache hit.
[2023-03-12 11:53:12] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/222 places, 426/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 165/222 places, 426/648 transitions.
Support contains 26 out of 165 places after structural reductions.
[2023-03-12 11:53:12] [INFO ] Flatten gal took : 55 ms
[2023-03-12 11:53:12] [INFO ] Flatten gal took : 27 ms
[2023-03-12 11:53:12] [INFO ] Input system was already deterministic with 426 transitions.
Support contains 25 out of 165 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10067 steps, including 3 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 11:53:13] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-12 11:53:13] [INFO ] Invariant cache hit.
[2023-03-12 11:53:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:53:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:13] [INFO ] After 169ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:8
[2023-03-12 11:53:13] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 11:53:13] [INFO ] After 41ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-12 11:53:13] [INFO ] After 349ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:9
[2023-03-12 11:53:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:53:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:14] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :9
[2023-03-12 11:53:14] [INFO ] After 136ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :2 sat :9
[2023-03-12 11:53:14] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :9
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-12 11:53:14] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :9
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 12 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 162 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 162 transition count 416
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 26 place count 162 transition count 396
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 161 transition count 394
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 161 transition count 394
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 44 place count 161 transition count 378
Applied a total of 44 rules in 91 ms. Remains 161 /165 variables (removed 4) and now considering 378/426 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 161/165 places, 378/426 transitions.
Incomplete random walk after 10016 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:53:14] [INFO ] Flow matrix only has 261 transitions (discarded 117 similar events)
// Phase 1: matrix 261 rows 161 cols
[2023-03-12 11:53:14] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 11:53:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:53:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:15] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:53:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:53:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:15] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-12 11:53:15] [INFO ] After 52ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:15] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 11:53:15] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 378/378 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 157 transition count 370
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 157 transition count 370
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 153 transition count 360
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 153 transition count 360
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 149 transition count 346
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 149 transition count 346
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 145 transition count 338
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 145 transition count 338
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 141 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 141 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 137 transition count 322
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 137 transition count 322
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 133 transition count 314
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 133 transition count 314
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 129 transition count 306
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 129 transition count 306
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 126 transition count 300
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 126 transition count 300
Applied a total of 70 rules in 47 ms. Remains 126 /161 variables (removed 35) and now considering 300/378 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 126/161 places, 300/378 transitions.
Incomplete random walk after 10014 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 523930 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 523930 steps, saw 344446 distinct states, run finished after 3002 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 11:53:18] [INFO ] Flow matrix only has 206 transitions (discarded 94 similar events)
// Phase 1: matrix 206 rows 126 cols
[2023-03-12 11:53:18] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-12 11:53:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-12 11:53:18] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:18] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 11:53:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-12 11:53:18] [INFO ] After 20ms SMT Verify possible using 47 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:53:18] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:53:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:53:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:18] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:18] [INFO ] After 24ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:18] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 11:53:18] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 300/300 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 300/300 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2023-03-12 11:53:18] [INFO ] Flow matrix only has 206 transitions (discarded 94 similar events)
[2023-03-12 11:53:18] [INFO ] Invariant cache hit.
[2023-03-12 11:53:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-12 11:53:18] [INFO ] Flow matrix only has 206 transitions (discarded 94 similar events)
[2023-03-12 11:53:18] [INFO ] Invariant cache hit.
[2023-03-12 11:53:18] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-12 11:53:19] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-12 11:53:19] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-12 11:53:19] [INFO ] Flow matrix only has 206 transitions (discarded 94 similar events)
[2023-03-12 11:53:19] [INFO ] Invariant cache hit.
[2023-03-12 11:53:19] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 126/126 places, 300/300 transitions.
Graph (trivial) has 179 edges and 126 vertex of which 24 / 126 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 118 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 110 transition count 174
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 102 transition count 174
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 17 place count 102 transition count 152
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 61 place count 80 transition count 152
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 73 transition count 145
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 73 transition count 145
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 89 place count 73 transition count 131
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 3 with 34 rules applied. Total rules applied 123 place count 56 transition count 114
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 130 place count 49 transition count 100
Iterating global reduction 3 with 7 rules applied. Total rules applied 137 place count 49 transition count 100
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 144 place count 42 transition count 86
Iterating global reduction 3 with 7 rules applied. Total rules applied 151 place count 42 transition count 86
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 158 place count 35 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 165 place count 35 transition count 72
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 172 place count 35 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 172 place count 35 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 34 transition count 64
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 180 place count 31 transition count 64
Applied a total of 180 rules in 32 ms. Remains 31 /126 variables (removed 95) and now considering 64/300 (removed 236) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 31 cols
[2023-03-12 11:53:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:53:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:53:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:19] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-12 11:53:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 11:53:19] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:53:19] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 11:53:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-12 11:53:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 11:53:19] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:19] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 11:53:19] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-12 11:53:19] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(X(X((p1 U p2))) U (p2||X(p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 398
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 398
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 28 place count 157 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 152 transition count 374
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 152 transition count 374
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 142 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 142 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 137 transition count 328
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 132 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 127 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 127 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 122 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 122 transition count 294
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 118 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 117 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 117 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 116 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 115 transition count 280
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 115 transition count 280
Applied a total of 112 rules in 30 ms. Remains 115 /165 variables (removed 50) and now considering 280/426 (removed 146) transitions.
[2023-03-12 11:53:19] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2023-03-12 11:53:19] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-12 11:53:19] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-12 11:53:19] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-12 11:53:19] [INFO ] Invariant cache hit.
[2023-03-12 11:53:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 11:53:19] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-12 11:53:19] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-12 11:53:19] [INFO ] Invariant cache hit.
[2023-03-12 11:53:20] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/165 places, 280/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 115/165 places, 280/426 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s95 1)), p2:(AND (GEQ s0 1) (GEQ s96 1)), p1:(AND (GEQ s0 1) (GEQ s32 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 762 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 U G(!p1)))))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 109 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 106 transition count 258
Applied a total of 126 rules in 18 ms. Remains 106 /165 variables (removed 59) and now considering 258/426 (removed 168) transitions.
[2023-03-12 11:53:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-12 11:53:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:53:20] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 11:53:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-12 11:53:20] [INFO ] Invariant cache hit.
[2023-03-12 11:53:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 11:53:20] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-12 11:53:20] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-12 11:53:20] [INFO ] Invariant cache hit.
[2023-03-12 11:53:20] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/165 places, 258/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 106/165 places, 258/426 transitions.
Stuttering acceptance computed with spot in 181 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s87 1)), p0:(AND (NOT (AND (GEQ s1 1) (GEQ s50 1))) (GEQ s0 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 291 steps with 3 reset in 10 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-04 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)||F(p1)))'
Support contains 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 127 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 122 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 113 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 113 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 112 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 111 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 110 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 110 transition count 266
Applied a total of 118 rules in 17 ms. Remains 110 /165 variables (removed 55) and now considering 266/426 (removed 160) transitions.
[2023-03-12 11:53:20] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 110 cols
[2023-03-12 11:53:20] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 11:53:21] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 11:53:21] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-12 11:53:21] [INFO ] Invariant cache hit.
[2023-03-12 11:53:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-12 11:53:21] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-12 11:53:21] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-12 11:53:21] [INFO ] Invariant cache hit.
[2023-03-12 11:53:21] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/165 places, 266/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 110/165 places, 266/426 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s81 1)), p0:(AND (GEQ s0 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b128-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLFireability-05 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 113 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 113 transition count 268
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 106 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 106 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 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 142 place count 97 transition count 234
Applied a total of 142 rules in 42 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-12 11:53:22] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-12 11:53:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:53:22] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-12 11:53:22] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 11:53:22] [INFO ] Invariant cache hit.
[2023-03-12 11:53:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 11:53:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-12 11:53:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-12 11:53:22] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 11:53:22] [INFO ] Invariant cache hit.
[2023-03-12 11:53:22] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1158 reset in 353 ms.
Stack based approach found an accepted trace after 64007 steps with 740 reset with depth 102 and stack size 102 in 226 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-06 finished in 1006 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 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 113 transition count 268
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 113 transition count 268
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 115 place count 106 transition count 254
Iterating global reduction 1 with 7 rules applied. Total rules applied 122 place count 106 transition count 254
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 99 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 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 142 place count 97 transition count 234
Applied a total of 142 rules in 43 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 11:53:23] [INFO ] Invariant cache hit.
[2023-03-12 11:53:23] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 11:53:23] [INFO ] Invariant cache hit.
[2023-03-12 11:53:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-12 11:53:23] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-12 11:53:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-12 11:53:23] [INFO ] Invariant cache hit.
[2023-03-12 11:53:23] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/165 places, 234/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 335 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 319 steps with 0 reset in 3 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 530 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 U X(p1))))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 142 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 142 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 136 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 136 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 130 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 130 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 118 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 118 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 112 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 112 transition count 268
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 106 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 103 transition count 250
Applied a total of 128 rules in 19 ms. Remains 103 /165 variables (removed 62) and now considering 250/426 (removed 176) transitions.
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2023-03-12 11:53:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 11:53:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-12 11:53:23] [INFO ] Invariant cache hit.
[2023-03-12 11:53:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 11:53:23] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-12 11:53:23] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-12 11:53:23] [INFO ] Invariant cache hit.
[2023-03-12 11:53:23] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/165 places, 250/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 103/165 places, 250/426 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s80 1) (NOT (AND (GEQ s1 1) (GEQ s40 1)))), p1:(AND (GEQ s1 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-09 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 157 transition count 390
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 157 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 151 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 151 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 145 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 145 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 139 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 139 transition count 328
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 133 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 121 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 121 transition count 292
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 115 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 115 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 110 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 110 transition count 270
Applied a total of 112 rules in 26 ms. Remains 110 /165 variables (removed 55) and now considering 270/426 (removed 156) transitions.
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
// Phase 1: matrix 183 rows 110 cols
[2023-03-12 11:53:24] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-12 11:53:24] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-12 11:53:24] [INFO ] Invariant cache hit.
[2023-03-12 11:53:24] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-12 11:53:24] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-12 11:53:24] [INFO ] Invariant cache hit.
[2023-03-12 11:53:24] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/165 places, 270/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 110/165 places, 270/426 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s101 1)), p1:(OR (AND (GEQ s0 1) (GEQ s15 1) (OR (LT s1 1) (LT s87 1))) (AND (GEQ s1 1) (GEQ s87 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-10 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||X(p1))&&(G(p2)||X(X(p3)))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 159 transition count 402
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 159 transition count 402
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 159 transition count 396
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 154 transition count 384
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 154 transition count 384
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 150 transition count 370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 146 transition count 356
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 146 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 142 transition count 348
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 142 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 138 transition count 338
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 138 transition count 338
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 130 transition count 320
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 130 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 127 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 127 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 126 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 126 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 125 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 125 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 124 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 124 transition count 308
Applied a total of 88 rules in 23 ms. Remains 124 /165 variables (removed 41) and now considering 308/426 (removed 118) transitions.
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
// Phase 1: matrix 207 rows 124 cols
[2023-03-12 11:53:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-12 11:53:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-12 11:53:24] [INFO ] Invariant cache hit.
[2023-03-12 11:53:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-12 11:53:24] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-12 11:53:24] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-12 11:53:24] [INFO ] Invariant cache hit.
[2023-03-12 11:53:25] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/165 places, 308/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 124/165 places, 308/426 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), true, (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 7}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s111 1) (GEQ s0 1) (GEQ s103 1)), p0:(AND (GEQ s1 1) (GEQ s105 1)), p1:(AND (GEQ s0 1) (GEQ s111 1)), p3:(OR (LT s1 1) (LT s102 1)...], 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, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 728 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 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 392
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 392
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 150 transition count 370
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 144 transition count 348
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 144 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 114 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 109 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 106 transition count 254
Applied a total of 130 rules in 37 ms. Remains 106 /165 variables (removed 59) and now considering 254/426 (removed 172) transitions.
[2023-03-12 11:53:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-12 11:53:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 11:53:25] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 11:53:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 11:53:25] [INFO ] Invariant cache hit.
[2023-03-12 11:53:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 11:53:25] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-12 11:53:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:53:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-12 11:53:25] [INFO ] Invariant cache hit.
[2023-03-12 11:53:25] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/165 places, 254/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 106/165 places, 254/426 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-12 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 156 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 156 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 156 transition count 384
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 28 place count 150 transition count 372
Iterating global reduction 1 with 6 rules applied. Total rules applied 34 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 144 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 138 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 138 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 132 transition count 314
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 132 transition count 314
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 120 transition count 286
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 108 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 105 transition count 256
Applied a total of 124 rules in 25 ms. Remains 105 /165 variables (removed 60) and now considering 256/426 (removed 170) transitions.
[2023-03-12 11:53:25] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2023-03-12 11:53:25] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 11:53:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-12 11:53:25] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-12 11:53:25] [INFO ] Invariant cache hit.
[2023-03-12 11:53:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-12 11:53:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-12 11:53:26] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-12 11:53:26] [INFO ] Invariant cache hit.
[2023-03-12 11:53:26] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/165 places, 256/426 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 105/165 places, 256/426 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-14 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 426/426 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 155 transition count 386
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 155 transition count 386
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 31 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 38 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 134 transition count 314
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 134 transition count 314
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 87 place count 120 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 94 place count 120 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 114 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 112 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 118 place count 108 transition count 258
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 103 transition count 248
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 100 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 100 transition count 240
Applied a total of 136 rules in 52 ms. Remains 100 /165 variables (removed 65) and now considering 240/426 (removed 186) transitions.
[2023-03-12 11:53:26] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2023-03-12 11:53:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-12 11:53:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 11:53:26] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:26] [INFO ] Invariant cache hit.
[2023-03-12 11:53:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 11:53:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-12 11:53:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:53:26] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:26] [INFO ] Invariant cache hit.
[2023-03-12 11:53:26] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/165 places, 240/426 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 100/165 places, 240/426 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1099 reset in 258 ms.
Product exploration explored 100000 steps with 1104 reset in 261 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 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1543 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=771 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-12 11:53:27] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:27] [INFO ] Invariant cache hit.
[2023-03-12 11:53:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 11:53:27] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:27] [INFO ] Invariant cache hit.
[2023-03-12 11:53:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 11:53:27] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-12 11:53:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:53:27] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:27] [INFO ] Invariant cache hit.
[2023-03-12 11:53:28] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 100/100 places, 240/240 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 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) 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
Finished probabilistic random walk after 10060 steps, run visited all 1 properties in 24 ms. (steps per millisecond=419 )
Probabilistic random walk after 10060 steps, saw 6628 distinct states, run finished after 24 ms. (steps per millisecond=419 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1075 reset in 262 ms.
Product exploration explored 100000 steps with 1118 reset in 261 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-12 11:53:29] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:29] [INFO ] Invariant cache hit.
[2023-03-12 11:53:29] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-12 11:53:29] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:29] [INFO ] Invariant cache hit.
[2023-03-12 11:53:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-12 11:53:29] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-12 11:53:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 11:53:29] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-12 11:53:29] [INFO ] Invariant cache hit.
[2023-03-12 11:53:29] [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 314 ms. Remains : 100/100 places, 240/240 transitions.
Treatment of property FunctionPointer-PT-b128-LTLFireability-15 finished in 3522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-12 11:53:29] [INFO ] Flatten gal took : 23 ms
[2023-03-12 11:53:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 11:53:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 165 places, 426 transitions and 1716 arcs took 4 ms.
Total runtime 18748 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/959/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : FunctionPointer-PT-b128-LTLFireability-15

BK_STOP 1678622011236

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name FunctionPointer-PT-b128-LTLFireability-15
ltl formula formula --ltl=/tmp/959/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 165 places, 426 transitions and 1716 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/959/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/959/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/959/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/959/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b128"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-b128, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838856300708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;