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

About the Execution of ITS-Tools for FunctionPointer-PT-b128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2713.424 43682.00 106563.00 210.30 FFTFFTFFFFFFFFFF 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.r165-tall-167838850800708.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 itstools
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 r165-tall-167838850800708
=====================================================================

--------------------
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 1679561001918

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-23 08:43:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-23 08:43:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:43:23] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-23 08:43:23] [INFO ] Transformed 306 places.
[2023-03-23 08:43:23] [INFO ] Transformed 840 transitions.
[2023-03-23 08:43:23] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-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 64 ms. Remains 165 /222 variables (removed 57) and now considering 426/648 (removed 222) transitions.
[2023-03-23 08:43:23] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
// Phase 1: matrix 285 rows 165 cols
[2023-03-23 08:43:23] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-23 08:43:24] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-23 08:43:24] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-23 08:43:24] [INFO ] Invariant cache hit.
[2023-03-23 08:43:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-23 08:43:24] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2023-03-23 08:43:24] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-23 08:43:24] [INFO ] Invariant cache hit.
[2023-03-23 08:43:24] [INFO ] Dead Transitions using invariants and state equation in 170 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 930 ms. Remains : 165/222 places, 426/648 transitions.
Support contains 26 out of 165 places after structural reductions.
[2023-03-23 08:43:24] [INFO ] Flatten gal took : 52 ms
[2023-03-23 08:43:24] [INFO ] Flatten gal took : 24 ms
[2023-03-23 08:43:24] [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 10001 steps, including 7 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) 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 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 08:43:25] [INFO ] Flow matrix only has 285 transitions (discarded 141 similar events)
[2023-03-23 08:43:25] [INFO ] Invariant cache hit.
[2023-03-23 08:43:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:25] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:4
[2023-03-23 08:43:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-23 08:43:25] [INFO ] After 45ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-23 08:43:25] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-23 08:43:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:25] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :6
[2023-03-23 08:43:25] [INFO ] After 83ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :2 sat :6
[2023-03-23 08:43:26] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :6
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-23 08:43:26] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :6
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 8 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 24 place count 159 transition count 390
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 155 transition count 380
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 155 transition count 380
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 152 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 152 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 149 transition count 358
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 149 transition count 358
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 146 transition count 352
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 146 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 143 transition count 346
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 143 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 140 transition count 340
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 140 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 137 transition count 334
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 137 transition count 334
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 135 transition count 330
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 135 transition count 330
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 82 place count 135 transition count 320
Applied a total of 82 rules in 63 ms. Remains 135 /165 variables (removed 30) and now considering 320/426 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 135/165 places, 320/426 transitions.
Incomplete random walk after 10002 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 08:43:26] [INFO ] Flow matrix only has 220 transitions (discarded 100 similar events)
// Phase 1: matrix 220 rows 135 cols
[2023-03-23 08:43:26] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-23 08:43:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 08:43:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-23 08:43:26] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 08:43:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-23 08:43:26] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 08:43:26] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-23 08:43:26] [INFO ] After 37ms SMT Verify possible using 50 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 08:43:26] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-23 08:43:26] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 320/320 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 133 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 133 transition count 316
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 131 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 131 transition count 310
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 130 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 130 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 129 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 129 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 128 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 128 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 127 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 127 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 126 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 126 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 296
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 292
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 292
Applied a total of 24 rules in 43 ms. Remains 123 /135 variables (removed 12) and now considering 292/320 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 123/135 places, 292/320 transitions.
Incomplete random walk after 10048 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=837 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:43:26] [INFO ] Flow matrix only has 199 transitions (discarded 93 similar events)
// Phase 1: matrix 199 rows 123 cols
[2023-03-23 08:43:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:43:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 08:43:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 08:43:26] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:26] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 08:43:26] [INFO ] After 20ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:26] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:27] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:27] [INFO ] After 13ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:27] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 08:43:27] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 292/292 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 121 transition count 288
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 121 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 120 transition count 284
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 120 transition count 284
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 119 transition count 282
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 119 transition count 282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 118 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 118 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 117 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 117 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 116 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 116 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 115 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 115 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 114 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 114 transition count 272
Applied a total of 18 rules in 29 ms. Remains 114 /123 variables (removed 9) and now considering 272/292 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 114/123 places, 272/292 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1513861 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1513861 steps, saw 995235 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:43:30] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
// Phase 1: matrix 185 rows 114 cols
[2023-03-23 08:43:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 08:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 08:43:30] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 08:43:30] [INFO ] After 14ms SMT Verify possible using 43 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:30] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 08:43:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] After 12ms SMT Verify possible using 43 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-23 08:43:30] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 272/272 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 114/114 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 272/272 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2023-03-23 08:43:30] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2023-03-23 08:43:30] [INFO ] Invariant cache hit.
[2023-03-23 08:43:30] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-23 08:43:30] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2023-03-23 08:43:30] [INFO ] Invariant cache hit.
[2023-03-23 08:43:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 08:43:30] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-23 08:43:30] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 08:43:30] [INFO ] Flow matrix only has 185 transitions (discarded 87 similar events)
[2023-03-23 08:43:30] [INFO ] Invariant cache hit.
[2023-03-23 08:43:30] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 114/114 places, 272/272 transitions.
Graph (trivial) has 163 edges and 114 vertex of which 24 / 114 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 71 transitions
Reduce isomorphic transitions removed 111 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 98 transition count 155
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 155
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 13 place count 92 transition count 136
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 51 place count 73 transition count 136
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 66 transition count 129
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 66 transition count 129
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 79 place count 66 transition count 115
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 113 place count 49 transition count 98
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 120 place count 42 transition count 84
Iterating global reduction 3 with 7 rules applied. Total rules applied 127 place count 42 transition count 84
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 134 place count 35 transition count 70
Iterating global reduction 3 with 7 rules applied. Total rules applied 141 place count 35 transition count 70
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 148 place count 28 transition count 56
Iterating global reduction 3 with 7 rules applied. Total rules applied 155 place count 28 transition count 56
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 162 place count 28 transition count 49
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 162 place count 28 transition count 48
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 164 place count 27 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 25 transition count 48
Applied a total of 168 rules in 17 ms. Remains 25 /114 variables (removed 89) and now considering 48/272 (removed 224) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 48 rows 25 cols
[2023-03-23 08:43:30] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:43:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 08:43:30] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:30] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:30] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:30] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 08:43:30] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
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 26 ms. Remains 115 /165 variables (removed 50) and now considering 280/426 (removed 146) transitions.
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2023-03-23 08:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 08:43:31] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-23 08:43:31] [INFO ] Invariant cache hit.
[2023-03-23 08:43:31] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 08:43:31] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2023-03-23 08:43:31] [INFO ] Invariant cache hit.
[2023-03-23 08:43:31] [INFO ] Dead Transitions using invariants and state equation in 102 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 346 ms. Remains : 115/165 places, 280/426 transitions.
Stuttering acceptance computed with spot in 275 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 297 steps with 0 reset in 9 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-03 finished in 694 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 22 ms. Remains 106 /165 variables (removed 59) and now considering 258/426 (removed 168) transitions.
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2023-03-23 08:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 08:43:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-23 08:43:31] [INFO ] Invariant cache hit.
[2023-03-23 08:43:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 08:43:31] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-23 08:43:31] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2023-03-23 08:43:31] [INFO ] Invariant cache hit.
[2023-03-23 08:43:32] [INFO ] Dead Transitions using invariants and state equation in 89 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 305 ms. Remains : 106/165 places, 258/426 transitions.
Stuttering acceptance computed with spot in 170 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 2230 steps with 21 reset in 34 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-04 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' '!((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 20 ms. Remains 110 /165 variables (removed 55) and now considering 266/426 (removed 160) transitions.
[2023-03-23 08:43:32] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 110 cols
[2023-03-23 08:43:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 08:43:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-23 08:43:32] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-23 08:43:32] [INFO ] Invariant cache hit.
[2023-03-23 08:43:32] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-23 08:43:32] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-23 08:43:32] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2023-03-23 08:43:32] [INFO ] Invariant cache hit.
[2023-03-23 08:43:32] [INFO ] Dead Transitions using invariants and state equation in 88 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 339 ms. Remains : 110/165 places, 266/426 transitions.
Stuttering acceptance computed with spot in 137 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 264 ms.
Product exploration explored 100000 steps with 50000 reset in 249 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 64 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 1079 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 45 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-23 08:43:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 08:43:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 08:43:33] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-23 08:43:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:33] [INFO ] Invariant cache hit.
[2023-03-23 08:43:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 08:43:33] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-23 08:43:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-23 08:43:33] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:33] [INFO ] Invariant cache hit.
[2023-03-23 08:43:33] [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 315 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 97 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 1152 reset in 266 ms.
Product exploration explored 100000 steps with 1173 reset in 354 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 134 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 139 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=139 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 11 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-23 08:43:34] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:34] [INFO ] Invariant cache hit.
[2023-03-23 08:43:35] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-23 08:43:35] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:35] [INFO ] Invariant cache hit.
[2023-03-23 08:43:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 08:43:35] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-23 08:43:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-23 08:43:35] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:35] [INFO ] Invariant cache hit.
[2023-03-23 08:43:35] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 280 ms. Remains : 97/97 places, 234/234 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 99 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 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1660169 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :{}
Probabilistic random walk after 1660169 steps, saw 1044202 distinct states, run finished after 3001 ms. (steps per millisecond=553 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:43:38] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:38] [INFO ] Invariant cache hit.
[2023-03-23 08:43:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-23 08:43:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-23 08:43:38] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 08:43:38] [INFO ] After 13ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:38] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-23 08:43:38] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:38] [INFO ] After 11ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:38] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 08:43:38] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 234/234 transitions.
Graph (complete) has 397 edges and 97 vertex of which 76 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 76 transition count 191
Applied a total of 44 rules in 8 ms. Remains 76 /97 variables (removed 21) and now considering 191/234 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 76/97 places, 191/234 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1919981 steps, run timeout after 3001 ms. (steps per millisecond=639 ) properties seen :{}
Probabilistic random walk after 1919981 steps, saw 1195392 distinct states, run finished after 3001 ms. (steps per millisecond=639 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 08:43:41] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
// Phase 1: matrix 117 rows 76 cols
[2023-03-23 08:43:41] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-23 08:43:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 08:43:41] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 08:43:41] [INFO ] After 8ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:41] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:41] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:41] [INFO ] After 7ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:41] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-23 08:43:41] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 76/76 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-23 08:43:41] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 08:43:41] [INFO ] Invariant cache hit.
[2023-03-23 08:43:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-23 08:43:41] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 08:43:41] [INFO ] Invariant cache hit.
[2023-03-23 08:43:41] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-23 08:43:41] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-23 08:43:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 08:43:41] [INFO ] Flow matrix only has 117 transitions (discarded 74 similar events)
[2023-03-23 08:43:41] [INFO ] Invariant cache hit.
[2023-03-23 08:43:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 76/76 places, 191/191 transitions.
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 76 transition count 110
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 88 place count 69 transition count 110
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 88 place count 69 transition count 97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 114 place count 56 transition count 97
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 144 place count 41 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 151 place count 34 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 158 place count 34 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 165 place count 27 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 172 place count 27 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 179 place count 20 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 186 place count 20 transition count 40
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 193 place count 20 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 193 place count 20 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 19 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 197 place count 18 transition count 32
Applied a total of 197 rules in 8 ms. Remains 18 /76 variables (removed 58) and now considering 32/191 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 18 cols
[2023-03-23 08:43:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-23 08:43:42] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:42] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 08:43:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 08:43:42] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:42] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 08:43:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 08:43:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:42] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 08:43:42] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-23 08:43:42] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1205 reset in 226 ms.
Product exploration explored 100000 steps with 1198 reset in 267 ms.
Built C files in :
/tmp/ltsmin14541618140045199988
[2023-03-23 08:43:42] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2023-03-23 08:43:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:42] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2023-03-23 08:43:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:42] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2023-03-23 08:43:42] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:42] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14541618140045199988
Running compilation step : cd /tmp/ltsmin14541618140045199988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 530 ms.
Running link step : cd /tmp/ltsmin14541618140045199988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14541618140045199988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16684290077727222874.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 11 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-23 08:43:58] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-23 08:43:58] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:43:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-23 08:43:58] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:58] [INFO ] Invariant cache hit.
[2023-03-23 08:43:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 08:43:58] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-23 08:43:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 08:43:58] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:58] [INFO ] Invariant cache hit.
[2023-03-23 08:43:58] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 97/97 places, 234/234 transitions.
Built C files in :
/tmp/ltsmin15857830123084370830
[2023-03-23 08:43:58] [INFO ] Computing symmetric may disable matrix : 234 transitions.
[2023-03-23 08:43:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:58] [INFO ] Computing symmetric may enable matrix : 234 transitions.
[2023-03-23 08:43:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:58] [INFO ] Computing Do-Not-Accords matrix : 234 transitions.
[2023-03-23 08:43:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-23 08:43:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15857830123084370830
Running compilation step : cd /tmp/ltsmin15857830123084370830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 434 ms.
Running link step : cd /tmp/ltsmin15857830123084370830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15857830123084370830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11336406444950023529.hoa' '--buchi-type=spotba'
LTSmin run took 478 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-b128-LTLFireability-06 finished in 25932 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 33 ms. Remains 97 /165 variables (removed 68) and now considering 234/426 (removed 192) transitions.
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:59] [INFO ] Invariant cache hit.
[2023-03-23 08:43:59] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:59] [INFO ] Invariant cache hit.
[2023-03-23 08:43:59] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-23 08:43:59] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-23 08:43:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-23 08:43:59] [INFO ] Invariant cache hit.
[2023-03-23 08:43:59] [INFO ] Dead Transitions using invariants and state equation in 86 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 306 ms. Remains : 97/165 places, 234/426 transitions.
Stuttering acceptance computed with spot in 31 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 160 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-07 finished in 351 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 21 ms. Remains 103 /165 variables (removed 62) and now considering 250/426 (removed 176) transitions.
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2023-03-23 08:43:59] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:43:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-23 08:43:59] [INFO ] Invariant cache hit.
[2023-03-23 08:43:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 08:43:59] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-23 08:43:59] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
[2023-03-23 08:43:59] [INFO ] Invariant cache hit.
[2023-03-23 08:43:59] [INFO ] Dead Transitions using invariants and state equation in 89 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 312 ms. Remains : 103/165 places, 250/426 transitions.
Stuttering acceptance computed with spot in 128 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 1 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 462 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 16 ms. Remains 110 /165 variables (removed 55) and now considering 270/426 (removed 156) transitions.
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
// Phase 1: matrix 183 rows 110 cols
[2023-03-23 08:44:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:44:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-23 08:44:00] [INFO ] Invariant cache hit.
[2023-03-23 08:44:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-23 08:44:00] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 183 transitions (discarded 87 similar events)
[2023-03-23 08:44:00] [INFO ] Invariant cache hit.
[2023-03-23 08:44:00] [INFO ] Dead Transitions using invariants and state equation in 100 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 476 ms. Remains : 110/165 places, 270/426 transitions.
Stuttering acceptance computed with spot in 119 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 610 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 22 ms. Remains 124 /165 variables (removed 41) and now considering 308/426 (removed 118) transitions.
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
// Phase 1: matrix 207 rows 124 cols
[2023-03-23 08:44:00] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:44:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-23 08:44:00] [INFO ] Invariant cache hit.
[2023-03-23 08:44:00] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-23 08:44:00] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-23 08:44:00] [INFO ] Flow matrix only has 207 transitions (discarded 101 similar events)
[2023-03-23 08:44:00] [INFO ] Invariant cache hit.
[2023-03-23 08:44:01] [INFO ] Dead Transitions using invariants and state equation in 111 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 338 ms. Remains : 124/165 places, 308/426 transitions.
Stuttering acceptance computed with spot in 323 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 86 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-11 finished in 686 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 35 ms. Remains 106 /165 variables (removed 59) and now considering 254/426 (removed 172) transitions.
[2023-03-23 08:44:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-23 08:44:01] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-23 08:44:01] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 08:44:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 08:44:01] [INFO ] Invariant cache hit.
[2023-03-23 08:44:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 08:44:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-23 08:44:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 08:44:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-23 08:44:01] [INFO ] Invariant cache hit.
[2023-03-23 08:44:01] [INFO ] Dead Transitions using invariants and state equation in 89 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 325 ms. Remains : 106/165 places, 254/426 transitions.
Stuttering acceptance computed with spot in 39 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 68 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-12 finished in 385 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 21 ms. Remains 105 /165 variables (removed 60) and now considering 256/426 (removed 170) transitions.
[2023-03-23 08:44:01] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 105 cols
[2023-03-23 08:44:01] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:44:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-23 08:44:01] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-23 08:44:01] [INFO ] Invariant cache hit.
[2023-03-23 08:44:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-23 08:44:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-23 08:44:02] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
[2023-03-23 08:44:02] [INFO ] Invariant cache hit.
[2023-03-23 08:44:02] [INFO ] Dead Transitions using invariants and state equation in 86 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 301 ms. Remains : 105/165 places, 256/426 transitions.
Stuttering acceptance computed with spot in 97 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 416 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 34 ms. Remains 100 /165 variables (removed 65) and now considering 240/426 (removed 186) transitions.
[2023-03-23 08:44:02] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2023-03-23 08:44:02] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-23 08:44:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-23 08:44:02] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-23 08:44:02] [INFO ] Invariant cache hit.
[2023-03-23 08:44:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-23 08:44:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-23 08:44:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 08:44:02] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-23 08:44:02] [INFO ] Invariant cache hit.
[2023-03-23 08:44:02] [INFO ] Dead Transitions using invariants and state equation in 79 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 311 ms. Remains : 100/165 places, 240/426 transitions.
Stuttering acceptance computed with spot in 63 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 1114 reset in 251 ms.
Product exploration explored 100000 steps with 1054 reset in 240 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 87 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 6503 steps, including 6 resets, run visited all 1 properties in 9 ms. (steps per millisecond=722 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 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 5 ms. Remains 100 /100 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2023-03-23 08:44:03] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-23 08:44:03] [INFO ] Invariant cache hit.
[2023-03-23 08:44:03] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-23 08:44:03] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-23 08:44:03] [INFO ] Invariant cache hit.
[2023-03-23 08:44:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-23 08:44:03] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-23 08:44:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 08:44:03] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
[2023-03-23 08:44:03] [INFO ] Invariant cache hit.
[2023-03-23 08:44:03] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 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 212 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3488 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=498 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1108 reset in 235 ms.
Stack based approach found an accepted trace after 38865 steps with 463 reset with depth 89 and stack size 89 in 96 ms.
FORMULA FunctionPointer-PT-b128-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b128-LTLFireability-15 finished in 2625 ms.
All properties solved by simple procedures.
Total runtime 41502 ms.

BK_STOP 1679561045600

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r165-tall-167838850800708"
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 ;