About the Execution of LTSMin+red for FunctionPointer-PT-b008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
861.495 | 236383.00 | 316461.00 | 542.20 | FFFTFFTTFFFFF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603000236.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FunctionPointer-PT-b008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 16:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Apr 11 16:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 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-b008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717188401106
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:46:42] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-31 20:46:42] [INFO ] Transformed 306 places.
[2024-05-31 20:46:42] [INFO ] Transformed 840 transitions.
[2024-05-31 20:46:42] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b008-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 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 570
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 570
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 132 place count 190 transition count 492
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 141 place count 181 transition count 474
Iterating global reduction 2 with 9 rules applied. Total rules applied 150 place count 181 transition count 474
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 175 transition count 462
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 175 transition count 462
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 165 place count 172 transition count 450
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 172 transition count 450
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 171 place count 169 transition count 444
Iterating global reduction 2 with 3 rules applied. Total rules applied 174 place count 169 transition count 444
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 175 place count 168 transition count 440
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 168 transition count 440
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 167 transition count 436
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 167 transition count 436
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 166 transition count 434
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 166 transition count 434
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 165 transition count 432
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 165 transition count 432
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 164 transition count 430
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 164 transition count 430
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 185 place count 163 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 186 place count 163 transition count 428
Applied a total of 186 rules in 117 ms. Remains 163 /222 variables (removed 59) and now considering 428/648 (removed 220) transitions.
[2024-05-31 20:46:42] [INFO ] Flow matrix only has 286 transitions (discarded 142 similar events)
// Phase 1: matrix 286 rows 163 cols
[2024-05-31 20:46:42] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 20:46:43] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-31 20:46:43] [INFO ] Flow matrix only has 286 transitions (discarded 142 similar events)
[2024-05-31 20:46:43] [INFO ] Invariant cache hit.
[2024-05-31 20:46:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 20:46:43] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-31 20:46:43] [INFO ] Flow matrix only has 286 transitions (discarded 142 similar events)
[2024-05-31 20:46:43] [INFO ] Invariant cache hit.
[2024-05-31 20:46:43] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 286/449 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 57/222 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 426 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/449 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 222 constraints, problems are : Problem set: 0 solved, 426 unsolved in 14941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 286/449 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 57/222 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/449 variables, 426/648 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 7 (OVERLAPS) 0/449 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 648 constraints, problems are : Problem set: 0 solved, 426 unsolved in 17569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
After SMT, in 33163ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 33181ms
Starting structural reductions in LTL mode, iteration 1 : 163/222 places, 428/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33948 ms. Remains : 163/222 places, 428/648 transitions.
Support contains 27 out of 163 places after structural reductions.
[2024-05-31 20:47:16] [INFO ] Flatten gal took : 69 ms
[2024-05-31 20:47:16] [INFO ] Flatten gal took : 60 ms
[2024-05-31 20:47:16] [INFO ] Input system was already deterministic with 428 transitions.
Support contains 26 out of 163 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40007 steps (39 resets) in 1050 ms. (38 steps per ms) remains 0/19 properties
FORMULA FunctionPointer-PT-b008-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F((F(p0)||p0)) U (F(p1)||!p2))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 153 transition count 384
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 153 transition count 384
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 153 transition count 382
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 145 transition count 364
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 145 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 140 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 140 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 135 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 135 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 127 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 127 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 123 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 123 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 119 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 119 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 115 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 115 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 114 transition count 282
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 114 transition count 282
Applied a total of 100 rules in 27 ms. Remains 114 /163 variables (removed 49) and now considering 282/428 (removed 146) transitions.
[2024-05-31 20:47:17] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
// Phase 1: matrix 191 rows 114 cols
[2024-05-31 20:47:17] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:47:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:47:17] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-31 20:47:17] [INFO ] Invariant cache hit.
[2024-05-31 20:47:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:47:17] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 280 sub problems to find dead transitions.
[2024-05-31 20:47:17] [INFO ] Flow matrix only has 191 transitions (discarded 91 similar events)
[2024-05-31 20:47:17] [INFO ] Invariant cache hit.
[2024-05-31 20:47:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/305 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 280 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 159 constraints, problems are : Problem set: 0 solved, 280 unsolved in 7359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 280 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 3 (OVERLAPS) 191/305 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 43/159 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 280/439 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 280 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 280 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 439 constraints, problems are : Problem set: 0 solved, 280 unsolved in 9175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 280/280 constraints, Known Traps: 0/0 constraints]
After SMT, in 16823ms problems are : Problem set: 0 solved, 280 unsolved
Search for dead transitions found 0 dead transitions in 16828ms
Starting structural reductions in LTL mode, iteration 1 : 114/163 places, 282/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17093 ms. Remains : 114/163 places, 282/428 transitions.
Stuttering acceptance computed with spot in 329 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR p1 (AND p0 (NOT p2))), (OR p0 p1)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-00 finished in 17493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(G((G(!p0)||p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 151 transition count 378
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 151 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 151 transition count 374
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 140 transition count 350
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 140 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 140 transition count 346
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 134 transition count 324
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 128 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 128 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 122 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 122 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 117 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 117 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 112 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 107 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 107 transition count 256
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 125 place count 102 transition count 246
Iterating global reduction 2 with 5 rules applied. Total rules applied 130 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 101 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 101 transition count 244
Applied a total of 132 rules in 23 ms. Remains 101 /163 variables (removed 62) and now considering 244/428 (removed 184) transitions.
[2024-05-31 20:47:35] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2024-05-31 20:47:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:47:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 20:47:35] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-31 20:47:35] [INFO ] Invariant cache hit.
[2024-05-31 20:47:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:47:35] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-31 20:47:35] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-31 20:47:35] [INFO ] Invariant cache hit.
[2024-05-31 20:47:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 5568 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 242/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 385 constraints, problems are : Problem set: 0 solved, 242 unsolved in 7116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 12880ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 12883ms
Starting structural reductions in LTL mode, iteration 1 : 101/163 places, 244/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13133 ms. Remains : 101/163 places, 244/428 transitions.
Stuttering acceptance computed with spot in 138 ms :[false, (AND p0 (NOT p1)), false]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 175 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 p0 (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 21 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b008-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLFireability-03 finished in 13749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p0))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 151 transition count 378
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 151 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 151 transition count 374
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 140 transition count 350
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 140 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 140 transition count 346
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 134 transition count 324
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 128 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 128 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 122 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 122 transition count 286
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 116 transition count 274
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 116 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 110 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 104 transition count 250
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 104 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 98 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 97 transition count 236
Applied a total of 140 rules in 24 ms. Remains 97 /163 variables (removed 66) and now considering 236/428 (removed 192) transitions.
[2024-05-31 20:47:48] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-31 20:47:48] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:47:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 20:47:48] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:47:48] [INFO ] Invariant cache hit.
[2024-05-31 20:47:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:47:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-31 20:47:49] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-31 20:47:49] [INFO ] Invariant cache hit.
[2024-05-31 20:47:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6065 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 11530ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 11533ms
Starting structural reductions in LTL mode, iteration 1 : 97/163 places, 236/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11767 ms. Remains : 97/163 places, 236/428 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), true, true, true]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-04
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-04 finished in 11918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 380
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 152 transition count 376
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 37 place count 141 transition count 352
Iterating global reduction 1 with 11 rules applied. Total rules applied 48 place count 141 transition count 352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 52 place count 141 transition count 348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 135 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 129 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 129 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 123 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 123 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 94 place count 117 transition count 276
Iterating global reduction 2 with 6 rules applied. Total rules applied 100 place count 117 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 111 transition count 264
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 111 transition count 264
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 105 transition count 252
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 105 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 130 place count 99 transition count 240
Iterating global reduction 2 with 6 rules applied. Total rules applied 136 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 137 place count 98 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 98 transition count 238
Applied a total of 138 rules in 26 ms. Remains 98 /163 variables (removed 65) and now considering 238/428 (removed 190) transitions.
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 98 cols
[2024-05-31 20:48:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:48:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 20:48:00] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 20:48:00] [INFO ] Invariant cache hit.
[2024-05-31 20:48:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 20:48:01] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 20:48:01] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 20:48:01] [INFO ] Invariant cache hit.
[2024-05-31 20:48:01] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5413 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 11863ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 11867ms
Starting structural reductions in LTL mode, iteration 1 : 98/163 places, 238/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12110 ms. Remains : 98/163 places, 238/428 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-05
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 5 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-05 finished in 12310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 151 transition count 378
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 151 transition count 378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 151 transition count 374
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 39 place count 140 transition count 350
Iterating global reduction 1 with 11 rules applied. Total rules applied 50 place count 140 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 140 transition count 346
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 134 transition count 324
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 128 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 128 transition count 300
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 122 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 122 transition count 286
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 116 transition count 274
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 116 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 110 transition count 262
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 104 transition count 250
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 104 transition count 250
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 132 place count 98 transition count 238
Iterating global reduction 2 with 6 rules applied. Total rules applied 138 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 97 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 97 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 97 transition count 234
Applied a total of 142 rules in 71 ms. Remains 97 /163 variables (removed 66) and now considering 234/428 (removed 194) transitions.
[2024-05-31 20:48:13] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-31 20:48:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:48:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 20:48:13] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:48:13] [INFO ] Invariant cache hit.
[2024-05-31 20:48:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 20:48:13] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-31 20:48:13] [INFO ] Redundant transitions in 10 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-31 20:48:13] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-31 20:48:13] [INFO ] Invariant cache hit.
[2024-05-31 20:48:13] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 11557ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 11560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 234/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11841 ms. Remains : 97/163 places, 234/428 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-09
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-09 finished in 11892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 153 transition count 390
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 153 transition count 390
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 153 transition count 386
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 144 transition count 366
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 144 transition count 366
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 54 place count 144 transition count 354
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 140 transition count 340
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 140 transition count 340
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 136 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 136 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 132 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 132 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 128 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 124 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 124 transition count 298
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 120 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 120 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 116 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 116 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 115 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 115 transition count 280
Applied a total of 112 rules in 29 ms. Remains 115 /163 variables (removed 48) and now considering 280/428 (removed 148) transitions.
[2024-05-31 20:48:25] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
// Phase 1: matrix 189 rows 115 cols
[2024-05-31 20:48:25] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:48:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 20:48:25] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2024-05-31 20:48:25] [INFO ] Invariant cache hit.
[2024-05-31 20:48:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:48:25] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-31 20:48:25] [INFO ] Flow matrix only has 189 transitions (discarded 91 similar events)
[2024-05-31 20:48:25] [INFO ] Invariant cache hit.
[2024-05-31 20:48:25] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/304 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 160 constraints, problems are : Problem set: 0 solved, 278 unsolved in 7376 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 189/304 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 278/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 438 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8599 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 16212ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 16217ms
Starting structural reductions in LTL mode, iteration 1 : 115/163 places, 280/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16473 ms. Remains : 115/163 places, 280/428 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-10
Stuttering criterion allowed to conclude after 215 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-10 finished in 16668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 153 transition count 388
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 153 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 24 place count 153 transition count 384
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 144 transition count 364
Iterating global reduction 1 with 9 rules applied. Total rules applied 42 place count 144 transition count 364
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 50 place count 144 transition count 356
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 139 transition count 338
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 139 transition count 338
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 135 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 135 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 131 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 131 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 127 transition count 306
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 127 transition count 306
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 123 transition count 298
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 123 transition count 298
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 119 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 119 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 104 place count 115 transition count 282
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 115 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 115 transition count 276
Applied a total of 114 rules in 44 ms. Remains 115 /163 variables (removed 48) and now considering 276/428 (removed 152) transitions.
[2024-05-31 20:48:41] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
// Phase 1: matrix 188 rows 115 cols
[2024-05-31 20:48:41] [INFO ] Computed 2 invariants in 4 ms
[2024-05-31 20:48:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 20:48:41] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
[2024-05-31 20:48:41] [INFO ] Invariant cache hit.
[2024-05-31 20:48:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 20:48:41] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-31 20:48:41] [INFO ] Redundant transitions in 15 ms returned []
Running 274 sub problems to find dead transitions.
[2024-05-31 20:48:41] [INFO ] Flow matrix only has 188 transitions (discarded 88 similar events)
[2024-05-31 20:48:41] [INFO ] Invariant cache hit.
[2024-05-31 20:48:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 188/303 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 160 constraints, problems are : Problem set: 0 solved, 274 unsolved in 7100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (OVERLAPS) 188/303 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 274/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 434 constraints, problems are : Problem set: 0 solved, 274 unsolved in 8633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints]
After SMT, in 15958ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 15961ms
Starting structural reductions in SI_LTL mode, iteration 1 : 115/163 places, 276/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16241 ms. Remains : 115/163 places, 276/428 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-11
Product exploration explored 100000 steps with 443 reset in 334 ms.
Stack based approach found an accepted trace after 50573 steps with 213 reset with depth 260 and stack size 259 in 206 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-11 finished in 16856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 152 transition count 380
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 142 transition count 358
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 142 transition count 358
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 54 place count 142 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 137 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 132 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 132 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 127 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 127 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 122 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 117 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 112 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 112 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 106 transition count 258
Applied a total of 126 rules in 16 ms. Remains 106 /163 variables (removed 57) and now considering 258/428 (removed 170) transitions.
[2024-05-31 20:48:58] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 20:48:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:48:58] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 20:48:58] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-31 20:48:58] [INFO ] Invariant cache hit.
[2024-05-31 20:48:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:48:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-31 20:48:58] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2024-05-31 20:48:58] [INFO ] Invariant cache hit.
[2024-05-31 20:48:58] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 5994 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 404 constraints, problems are : Problem set: 0 solved, 256 unsolved in 7297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 13482ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 13487ms
Starting structural reductions in LTL mode, iteration 1 : 106/163 places, 258/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13706 ms. Remains : 106/163 places, 258/428 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-12
Stuttering criterion allowed to conclude after 380 steps with 1 reset in 3 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-12 finished in 13860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 382
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 152 transition count 378
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 142 transition count 356
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 142 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 132 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 132 transition count 314
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 127 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 122 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 117 transition count 282
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 117 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 112 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 112 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 107 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 106 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 126 place count 106 transition count 256
Applied a total of 126 rules in 37 ms. Remains 106 /163 variables (removed 57) and now considering 256/428 (removed 172) transitions.
[2024-05-31 20:49:12] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-31 20:49:12] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:49:12] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 20:49:12] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:12] [INFO ] Invariant cache hit.
[2024-05-31 20:49:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:49:12] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-31 20:49:12] [INFO ] Redundant transitions in 4 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 20:49:12] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:12] [INFO ] Invariant cache hit.
[2024-05-31 20:49:12] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6247 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 13571ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 13575ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/163 places, 256/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13961 ms. Remains : 106/163 places, 256/428 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-13
Product exploration explored 100000 steps with 445 reset in 220 ms.
Product exploration explored 100000 steps with 458 reset in 229 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 30552 steps (53 resets) in 198 ms. (153 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-31 20:49:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:27] [INFO ] Invariant cache hit.
[2024-05-31 20:49:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 20:49:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:27] [INFO ] Invariant cache hit.
[2024-05-31 20:49:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:49:27] [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.
[2024-05-31 20:49:27] [INFO ] Redundant transitions in 3 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 20:49:27] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:27] [INFO ] Invariant cache hit.
[2024-05-31 20:49:27] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 14047ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 14050ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14261 ms. Remains : 106/106 places, 256/256 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 : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 25429 steps (44 resets) in 176 ms. (143 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 457 reset in 209 ms.
Product exploration explored 100000 steps with 444 reset in 262 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2024-05-31 20:49:43] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:43] [INFO ] Invariant cache hit.
[2024-05-31 20:49:43] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 20:49:43] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:43] [INFO ] Invariant cache hit.
[2024-05-31 20:49:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:49:43] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-31 20:49:43] [INFO ] Redundant transitions in 2 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 20:49:43] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-31 20:49:43] [INFO ] Invariant cache hit.
[2024-05-31 20:49:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6272 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 13523ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 13526ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13756 ms. Remains : 106/106 places, 256/256 transitions.
Treatment of property FunctionPointer-PT-b008-LTLFireability-13 finished in 44488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p1)&&p0)))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 380
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 152 transition count 376
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 142 transition count 356
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 142 transition count 356
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 55 place count 137 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 60 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 132 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 132 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 127 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 127 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 122 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 95 place count 117 transition count 282
Iterating global reduction 2 with 5 rules applied. Total rules applied 100 place count 117 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 105 place count 112 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 110 place count 112 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 107 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 107 transition count 262
Applied a total of 120 rules in 19 ms. Remains 107 /163 variables (removed 56) and now considering 262/428 (removed 166) transitions.
[2024-05-31 20:49:56] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-31 20:49:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 20:49:56] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 20:49:56] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 20:49:56] [INFO ] Invariant cache hit.
[2024-05-31 20:49:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:49:57] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-31 20:49:57] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-31 20:49:57] [INFO ] Invariant cache hit.
[2024-05-31 20:49:57] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 149 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 409 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7628 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 13964ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 13967ms
Starting structural reductions in LTL mode, iteration 1 : 107/163 places, 262/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14194 ms. Remains : 107/163 places, 262/428 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-14 finished in 14435 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 428/428 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 384
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 152 transition count 380
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 36 place count 142 transition count 358
Iterating global reduction 1 with 10 rules applied. Total rules applied 46 place count 142 transition count 358
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 54 place count 142 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 137 transition count 332
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 137 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 132 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 132 transition count 312
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 127 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 127 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 122 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 122 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 117 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 112 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 112 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 107 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 106 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 106 transition count 254
Applied a total of 130 rules in 32 ms. Remains 106 /163 variables (removed 57) and now considering 254/428 (removed 174) transitions.
[2024-05-31 20:50:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-31 20:50:11] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 20:50:11] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 20:50:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:50:11] [INFO ] Invariant cache hit.
[2024-05-31 20:50:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 20:50:11] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-31 20:50:11] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-31 20:50:11] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 20:50:11] [INFO ] Invariant cache hit.
[2024-05-31 20:50:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 13645ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 13649ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/163 places, 254/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13902 ms. Remains : 106/163 places, 254/428 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-15
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-15 finished in 13955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2024-05-31 20:50:25] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:50:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 20:50:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 428 transitions and 1726 arcs took 5 ms.
Total runtime 223251 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b008-LTLFireability-13
BK_STOP 1717188637489
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b008-LTLFireability-13
ltl formula formula --ltl=/tmp/1000/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 428 transitions and 1726 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1000/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1000/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1000/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1000/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 434 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~1372 levels ~10000 states ~29868 transitions
pnml2lts-mc( 1/ 4): ~2684 levels ~20000 states ~58984 transitions
pnml2lts-mc( 1/ 4): ~5307 levels ~40000 states ~117176 transitions
pnml2lts-mc( 1/ 4): ~10557 levels ~80000 states ~233676 transitions
pnml2lts-mc( 1/ 4): ~21057 levels ~160000 states ~466676 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1023996 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~2047996 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~4095996 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2150052
pnml2lts-mc( 0/ 4): unique transitions count: 7422822
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 618718
pnml2lts-mc( 0/ 4): - claim success count: 2150066
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1888735
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2150066 states 7422873 transitions, fanout: 3.452
pnml2lts-mc( 0/ 4): Total exploration time 11.270 sec (11.250 sec minimum, 11.257 sec on average)
pnml2lts-mc( 0/ 4): States per second: 190778, Transitions per second: 658640
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.9MB, 17.9 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 431 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.9MB (~256.0MB paged-in)
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-b008"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FunctionPointer-PT-b008, 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 r496-tall-171640603000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 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 '
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 ;