Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 11:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678505056979

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:24:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:24:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:24:18] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-11 03:24:18] [INFO ] Transformed 306 places.
[2023-03-11 03:24:18] [INFO ] Transformed 840 transitions.
[2023-03-11 03:24:18] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b016-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 35 place count 187 transition count 534
Iterating global reduction 1 with 25 rules applied. Total rules applied 60 place count 187 transition count 534
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 187 transition count 476
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 129 place count 176 transition count 454
Iterating global reduction 2 with 11 rules applied. Total rules applied 140 place count 176 transition count 454
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 156 place count 176 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 171 transition count 428
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 171 transition count 428
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 169 place count 168 transition count 416
Iterating global reduction 3 with 3 rules applied. Total rules applied 172 place count 168 transition count 416
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 165 transition count 410
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 165 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 163 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 163 transition count 402
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 184 place count 161 transition count 394
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 161 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 188 place count 159 transition count 390
Iterating global reduction 3 with 2 rules applied. Total rules applied 190 place count 159 transition count 390
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 192 place count 157 transition count 386
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 157 transition count 386
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 196 place count 155 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 155 transition count 382
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 200 place count 153 transition count 378
Iterating global reduction 3 with 2 rules applied. Total rules applied 202 place count 153 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 204 place count 151 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 206 place count 151 transition count 374
Applied a total of 206 rules in 82 ms. Remains 151 /222 variables (removed 71) and now considering 374/648 (removed 274) transitions.
[2023-03-11 03:24:18] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
// Phase 1: matrix 254 rows 151 cols
[2023-03-11 03:24:18] [INFO ] Computed 2 place invariants in 18 ms
[2023-03-11 03:24:19] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-03-11 03:24:19] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-11 03:24:19] [INFO ] Invariant cache hit.
[2023-03-11 03:24:19] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-11 03:24:19] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-11 03:24:19] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-11 03:24:19] [INFO ] Invariant cache hit.
[2023-03-11 03:24:19] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/222 places, 374/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 151/222 places, 374/648 transitions.
Support contains 21 out of 151 places after structural reductions.
[2023-03-11 03:24:19] [INFO ] Flatten gal took : 47 ms
[2023-03-11 03:24:19] [INFO ] Flatten gal took : 22 ms
[2023-03-11 03:24:19] [INFO ] Input system was already deterministic with 374 transitions.
Support contains 20 out of 151 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 03:24:20] [INFO ] Flow matrix only has 254 transitions (discarded 120 similar events)
[2023-03-11 03:24:20] [INFO ] Invariant cache hit.
[2023-03-11 03:24:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:24:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:20] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 03:24:20] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-11 03:24:20] [INFO ] After 55ms SMT Verify possible using 54 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:24:20] [INFO ] After 232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:24:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:24:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:20] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:20] [INFO ] After 45ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:24:20] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-11 03:24:20] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 145 transition count 360
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 145 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 145 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 140 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 140 transition count 348
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 137 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 137 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 134 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 134 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 132 transition count 322
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 126 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 126 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 124 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 124 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 123 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 123 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 122 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 122 transition count 300
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 122 transition count 292
Applied a total of 68 rules in 74 ms. Remains 122 /151 variables (removed 29) and now considering 292/374 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 122/151 places, 292/374 transitions.
Incomplete random walk after 10004 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:24:20] [INFO ] Flow matrix only has 200 transitions (discarded 92 similar events)
// Phase 1: matrix 200 rows 122 cols
[2023-03-11 03:24:21] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:24:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:21] [INFO ] After 42ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 03:24:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:24:21] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:21] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 03:24:21] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:21] [INFO ] After 19ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:21] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 03:24:21] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 292/292 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 284
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 284
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 118 transition count 280
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 118 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 116 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 114 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 114 transition count 270
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 112 transition count 266
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 112 transition count 266
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 110 transition count 262
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 110 transition count 262
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 108 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 108 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 107 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 107 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 106 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 106 transition count 254
Applied a total of 32 rules in 38 ms. Remains 106 /122 variables (removed 16) and now considering 254/292 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 106/122 places, 254/292 transitions.
Finished random walk after 2639 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=527 )
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 142 transition count 350
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 142 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 142 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 134 transition count 330
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 134 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 109 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 105 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 105 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 101 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 99 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 97 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 97 transition count 236
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 97 transition count 234
Applied a total of 112 rules in 48 ms. Remains 97 /151 variables (removed 54) and now considering 234/374 (removed 140) transitions.
[2023-03-11 03:24:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2023-03-11 03:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:24:21] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:24:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:24:21] [INFO ] Invariant cache hit.
[2023-03-11 03:24:21] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-11 03:24:21] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 03:24:21] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-11 03:24:21] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2023-03-11 03:24:21] [INFO ] Invariant cache hit.
[2023-03-11 03:24:21] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/151 places, 234/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 97/151 places, 234/374 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 630 steps with 0 reset in 13 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-03 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 43 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-11 03:24:21] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-11 03:24:21] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:24:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 03:24:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:22] [INFO ] Invariant cache hit.
[2023-03-11 03:24:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:22] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 03:24:22] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 03:24:22] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:22] [INFO ] Invariant cache hit.
[2023-03-11 03:24:22] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s87 1)), p0:(AND (GEQ s1 1) (GEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 573 reset in 434 ms.
Product exploration explored 100000 steps with 626 reset in 316 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 (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10012 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:24:23] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:23] [INFO ] Invariant cache hit.
[2023-03-11 03:24:23] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:23] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:23] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:23] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:23] [INFO ] After 21ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:23] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 03:24:23] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 106/106 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1736686 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :{}
Probabilistic random walk after 1736686 steps, saw 1104015 distinct states, run finished after 3001 ms. (steps per millisecond=578 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:24:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:26] [INFO ] Invariant cache hit.
[2023-03-11 03:24:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:24:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:26] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:24:26] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:26] [INFO ] After 13ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:26] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 03:24:26] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 106/106 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-11 03:24:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:26] [INFO ] Invariant cache hit.
[2023-03-11 03:24:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 03:24:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:26] [INFO ] Invariant cache hit.
[2023-03-11 03:24:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-11 03:24:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-11 03:24:26] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:27] [INFO ] Invariant cache hit.
[2023-03-11 03:24:27] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 106/106 places, 254/254 transitions.
Graph (trivial) has 152 edges and 106 vertex of which 24 / 106 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 106 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 90 transition count 142
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 84 transition count 142
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 13 place count 84 transition count 125
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 47 place count 67 transition count 125
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 60 transition count 118
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 60 transition count 118
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 75 place count 60 transition count 104
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 105 place count 45 transition count 89
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 112 place count 38 transition count 75
Iterating global reduction 3 with 7 rules applied. Total rules applied 119 place count 38 transition count 75
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 125 place count 32 transition count 63
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 32 transition count 63
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 137 place count 26 transition count 51
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 26 transition count 51
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 149 place count 26 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 23 transition count 46
Applied a total of 155 rules in 17 ms. Remains 23 /106 variables (removed 83) and now considering 46/254 (removed 208) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 23 cols
[2023-03-11 03:24:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 03:24:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:24:27] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:24:27] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 03:24:27] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:27] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:24:27] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 187 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-11 03:24:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2023-03-11 03:24:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 03:24:27] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 03:24:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:27] [INFO ] Invariant cache hit.
[2023-03-11 03:24:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:27] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-11 03:24:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 03:24:27] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:27] [INFO ] Invariant cache hit.
[2023-03-11 03:24:27] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 106/106 places, 254/254 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 (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:24:28] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:28] [INFO ] Invariant cache hit.
[2023-03-11 03:24:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:24:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 03:24:28] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:24:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 03:24:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 03:24:28] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:28] [INFO ] After 13ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:24:28] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 03:24:28] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 106/106 places, 254/254 transitions.
Finished random walk after 9771 steps, including 10 resets, run visited all 1 properties in 10 ms. (steps per millisecond=977 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 213 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 588 reset in 265 ms.
Product exploration explored 100000 steps with 610 reset in 255 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:29] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-11 03:24:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 106/106 places, 254/254 transitions.
Treatment of property FunctionPointer-PT-b016-LTLFireability-06 finished in 7659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 334
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 334
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 131 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 131 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 126 transition count 302
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 122 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 122 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 118 transition count 282
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 118 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 72 place count 114 transition count 274
Iterating global reduction 1 with 4 rules applied. Total rules applied 76 place count 114 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 111 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 108 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 106 transition count 258
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 106 transition count 254
Applied a total of 96 rules in 30 ms. Remains 106 /151 variables (removed 45) and now considering 254/374 (removed 120) transitions.
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:29] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-11 03:24:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 03:24:29] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2023-03-11 03:24:29] [INFO ] Invariant cache hit.
[2023-03-11 03:24:29] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/151 places, 254/374 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 106/151 places, 254/374 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s87 1) (OR (LT s0 1) (LT s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-07 finished in 461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((p0||X(F(p1))))&&G(p2)))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 354
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 340
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 322
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 314
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 300
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 296
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 288
Applied a total of 70 rules in 27 ms. Remains 117 /151 variables (removed 34) and now considering 288/374 (removed 86) transitions.
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
// Phase 1: matrix 196 rows 117 cols
[2023-03-11 03:24:30] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:24:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-11 03:24:30] [INFO ] Invariant cache hit.
[2023-03-11 03:24:30] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-11 03:24:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 196 transitions (discarded 92 similar events)
[2023-03-11 03:24:30] [INFO ] Invariant cache hit.
[2023-03-11 03:24:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 288/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 117/151 places, 288/374 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p2:(AND (GEQ s0 1) (GEQ s100 1)), p0:(AND (GEQ s5 1) (GEQ s107 1)), p1:(AND (GEQ s1 1) (GEQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-08 finished in 607 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p0)&&(G(p2)||p1)))&&X(p3))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 145 transition count 358
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 145 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 145 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 19 place count 140 transition count 346
Iterating global reduction 1 with 5 rules applied. Total rules applied 24 place count 140 transition count 346
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 137 transition count 334
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 137 transition count 334
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 134 transition count 326
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 134 transition count 326
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 132 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 130 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 130 transition count 314
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 128 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 128 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 126 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 126 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 124 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 123 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 122 transition count 298
Applied a total of 60 rules in 18 ms. Remains 122 /151 variables (removed 29) and now considering 298/374 (removed 76) transitions.
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
// Phase 1: matrix 202 rows 122 cols
[2023-03-11 03:24:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:24:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-11 03:24:30] [INFO ] Invariant cache hit.
[2023-03-11 03:24:30] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 03:24:30] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 03:24:30] [INFO ] Flow matrix only has 202 transitions (discarded 96 similar events)
[2023-03-11 03:24:30] [INFO ] Invariant cache hit.
[2023-03-11 03:24:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/151 places, 298/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 122/151 places, 298/374 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 1}, { cond=p0, acceptance={1} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s95 1)), p1:(OR (LT s0 1) (LT s103 1)), p2:(OR (LT s0 1) (LT s103 1)), p3:(OR (LT s1 1) (LT s102 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 933 reset in 312 ms.
Stack based approach found an accepted trace after 11127 steps with 116 reset with depth 682 and stack size 680 in 37 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-09 finished in 1072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 144 transition count 354
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 144 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 138 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 138 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 135 transition count 328
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 135 transition count 328
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 132 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 132 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 129 transition count 312
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 129 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 126 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 123 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 123 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 121 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 117 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 117 transition count 286
Applied a total of 70 rules in 19 ms. Remains 117 /151 variables (removed 34) and now considering 286/374 (removed 88) transitions.
[2023-03-11 03:24:31] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
// Phase 1: matrix 194 rows 117 cols
[2023-03-11 03:24:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:24:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 03:24:31] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-11 03:24:31] [INFO ] Invariant cache hit.
[2023-03-11 03:24:31] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-11 03:24:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-11 03:24:31] [INFO ] Flow matrix only has 194 transitions (discarded 92 similar events)
[2023-03-11 03:24:31] [INFO ] Invariant cache hit.
[2023-03-11 03:24:32] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/151 places, 286/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 117/151 places, 286/374 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1)), p1:(AND (GEQ s4 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-10 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p1)&&p0))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 143 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 136 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 136 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 132 transition count 322
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 132 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 128 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 124 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 124 transition count 300
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 68 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 72 place count 116 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 113 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 106 transition count 260
Applied a total of 92 rules in 29 ms. Remains 106 /151 variables (removed 45) and now considering 260/374 (removed 114) transitions.
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 106 cols
[2023-03-11 03:24:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 03:24:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:24:32] [INFO ] Invariant cache hit.
[2023-03-11 03:24:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-11 03:24:32] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2023-03-11 03:24:32] [INFO ] Invariant cache hit.
[2023-03-11 03:24:32] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/151 places, 260/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 106/151 places, 260/374 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s94 1)), p1:(OR (LT s0 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-11 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 374/374 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 352
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 352
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 135 transition count 334
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 135 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 130 transition count 316
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 125 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 120 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 115 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 110 transition count 264
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 110 transition count 264
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 106 transition count 256
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 106 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 94 place count 102 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 98 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 100 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 99 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 99 transition count 242
Applied a total of 104 rules in 18 ms. Remains 99 /151 variables (removed 52) and now considering 242/374 (removed 132) transitions.
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2023-03-11 03:24:32] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 03:24:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-11 03:24:32] [INFO ] Invariant cache hit.
[2023-03-11 03:24:32] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-11 03:24:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-11 03:24:32] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2023-03-11 03:24:32] [INFO ] Invariant cache hit.
[2023-03-11 03:24:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 99/151 places, 242/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 99/151 places, 242/374 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b016-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLFireability-15 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-11 03:24:33] [INFO ] Flatten gal took : 17 ms
[2023-03-11 03:24:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:24:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 374 transitions and 1510 arcs took 3 ms.
Total runtime 15296 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b016
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678505099739

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b016-LTLFireability-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 7/32 FunctionPointer-PT-b016-LTLFireability-06 799471 m, 159894 m/sec, 1033455 t fired, .

Time elapsed: 5 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 14/32 FunctionPointer-PT-b016-LTLFireability-06 1593283 m, 158762 m/sec, 2059602 t fired, .

Time elapsed: 10 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 20/32 FunctionPointer-PT-b016-LTLFireability-06 2384650 m, 158273 m/sec, 3082587 t fired, .

Time elapsed: 15 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 27/32 FunctionPointer-PT-b016-LTLFireability-06 3173344 m, 157738 m/sec, 4102119 t fired, .

Time elapsed: 20 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b016-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b016-LTLFireability-06: LTL unknown AGGR


Time elapsed: 25 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-b016, examination is 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 r167-tall-167838853400684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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