fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282300460
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16222.359 3600000.00 3852925.00 66230.00 TFFFFT?FTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Jun 7 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 6 15:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 6 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 7 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 391K Jun 6 12:11 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-b064-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b064-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654842450656

Running Version 202205111006
[2022-06-10 06:27:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 06:27:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 06:27:32] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-10 06:27:32] [INFO ] Transformed 306 places.
[2022-06-10 06:27:32] [INFO ] Transformed 840 transitions.
[2022-06-10 06:27:32] [INFO ] Parsed PT model containing 306 places and 840 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 7 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b064-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b064-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 32 place count 190 transition count 518
Iterating global reduction 1 with 22 rules applied. Total rules applied 54 place count 190 transition count 518
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 82 place count 190 transition count 490
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 176 transition count 462
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 176 transition count 462
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 118 place count 176 transition count 454
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 170 transition count 442
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 170 transition count 442
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 136 place count 164 transition count 418
Iterating global reduction 3 with 6 rules applied. Total rules applied 142 place count 164 transition count 418
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 147 place count 159 transition count 408
Iterating global reduction 3 with 5 rules applied. Total rules applied 152 place count 159 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 155 transition count 392
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 155 transition count 392
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 154 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 154 transition count 388
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 153 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 153 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 152 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 152 transition count 384
Applied a total of 166 rules in 84 ms. Remains 152 /222 variables (removed 70) and now considering 384/648 (removed 264) transitions.
[2022-06-10 06:27:32] [INFO ] Flow matrix only has 262 transitions (discarded 122 similar events)
// Phase 1: matrix 262 rows 152 cols
[2022-06-10 06:27:32] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-10 06:27:32] [INFO ] Implicit Places using invariants in 254 ms returned []
[2022-06-10 06:27:32] [INFO ] Flow matrix only has 262 transitions (discarded 122 similar events)
// Phase 1: matrix 262 rows 152 cols
[2022-06-10 06:27:32] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-10 06:27:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-10 06:27:32] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2022-06-10 06:27:32] [INFO ] Flow matrix only has 262 transitions (discarded 122 similar events)
// Phase 1: matrix 262 rows 152 cols
[2022-06-10 06:27:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:32] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/222 places, 384/648 transitions.
Finished structural reductions, in 1 iterations. Remains : 152/222 places, 384/648 transitions.
Support contains 23 out of 152 places after structural reductions.
[2022-06-10 06:27:33] [INFO ] Flatten gal took : 54 ms
[2022-06-10 06:27:33] [INFO ] Flatten gal took : 26 ms
[2022-06-10 06:27:33] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 22 out of 152 places (down from 23) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-10 06:27:33] [INFO ] Flow matrix only has 262 transitions (discarded 122 similar events)
// Phase 1: matrix 262 rows 152 cols
[2022-06-10 06:27:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 06:27:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-10 06:27:33] [INFO ] After 112ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:1
[2022-06-10 06:27:33] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-10 06:27:33] [INFO ] After 48ms SMT Verify possible using 58 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-10 06:27:33] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2022-06-10 06:27:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 06:27:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 06:27:34] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2022-06-10 06:27:34] [INFO ] After 60ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2022-06-10 06:27:34] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2022-06-10 06:27:34] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 62 ms.
Support contains 7 out of 152 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 143 transition count 354
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 143 transition count 354
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 28 place count 143 transition count 344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 139 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 135 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 135 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 131 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 131 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 56 place count 127 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 127 transition count 308
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 123 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 123 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 122 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 122 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 121 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 121 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 120 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 120 transition count 294
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 120 transition count 288
Applied a total of 80 rules in 87 ms. Remains 120 /152 variables (removed 32) and now considering 288/384 (removed 96) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/152 places, 288/384 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-10 06:27:34] [INFO ] Flow matrix only has 198 transitions (discarded 90 similar events)
// Phase 1: matrix 198 rows 120 cols
[2022-06-10 06:27:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 06:27:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-10 06:27:34] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-10 06:27:34] [INFO ] State equation strengthened by 46 read => feed constraints.
[2022-06-10 06:27:34] [INFO ] After 17ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:27:34] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 06:27:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-10 06:27:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-10 06:27:34] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 06:27:34] [INFO ] After 14ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 06:27:34] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-10 06:27:34] [INFO ] After 116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 120/120 places, 288/288 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 117 transition count 282
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 117 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 117 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 115 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 115 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 113 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 113 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 112 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 112 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 111 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 111 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 110 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 110 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 109 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 109 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 108 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 108 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 107 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 107 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 106 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 106 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 105 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 105 transition count 252
Applied a total of 32 rules in 56 ms. Remains 105 /120 variables (removed 15) and now considering 252/288 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 105/120 places, 252/288 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 81 steps, run visited all 1 properties in 8 ms. (steps per millisecond=10 )
Probabilistic random walk after 81 steps, saw 65 distinct states, run finished after 8 ms. (steps per millisecond=10 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 354
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 354
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 42 place count 140 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 134 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 134 transition count 322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 128 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 123 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 113 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 111 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 107 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 106 transition count 258
Applied a total of 110 rules in 22 ms. Remains 106 /152 variables (removed 46) and now considering 258/384 (removed 126) transitions.
[2022-06-10 06:27:35] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 06:27:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-06-10 06:27:35] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 06:27:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:35] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2022-06-10 06:27:35] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
// Phase 1: matrix 174 rows 106 cols
[2022-06-10 06:27:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:35] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/152 places, 258/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/152 places, 258/384 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 333 ms.
Product exploration explored 100000 steps with 33333 reset in 287 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA FunctionPointer-PT-b064-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b064-LTLFireability-00 finished in 1305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 139 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 139 transition count 346
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 139 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 132 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 132 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 125 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 119 transition count 284
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 119 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 113 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 113 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 107 transition count 256
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 104 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 101 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 101 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 99 transition count 240
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 98 transition count 238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 97 transition count 236
Applied a total of 122 rules in 37 ms. Remains 97 /152 variables (removed 55) and now considering 236/384 (removed 148) transitions.
[2022-06-10 06:27:36] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 06:27:36] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:27:36] [INFO ] Implicit Places using invariants in 116 ms returned []
[2022-06-10 06:27:36] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 06:27:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:36] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 06:27:36] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2022-06-10 06:27:36] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2022-06-10 06:27:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:36] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/152 places, 236/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 97/152 places, 236/384 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s0 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-01 finished in 516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 348
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 140 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 133 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 133 transition count 322
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 126 transition count 302
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 126 transition count 302
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 120 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 120 transition count 288
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 114 transition count 274
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 114 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 108 transition count 260
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 102 transition count 248
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 100 transition count 244
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 98 transition count 240
Applied a total of 118 rules in 26 ms. Remains 98 /152 variables (removed 54) and now considering 240/384 (removed 144) transitions.
[2022-06-10 06:27:36] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 06:27:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2022-06-10 06:27:37] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 06:27:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-10 06:27:37] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2022-06-10 06:27:37] [INFO ] Flow matrix only has 161 transitions (discarded 79 similar events)
// Phase 1: matrix 161 rows 98 cols
[2022-06-10 06:27:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:37] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/152 places, 240/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/152 places, 240/384 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-03 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 348
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 348
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 34 place count 140 transition count 338
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 133 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 133 transition count 322
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 126 transition count 302
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 121 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 111 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 111 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 109 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 105 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 104 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 104 transition count 254
Applied a total of 106 rules in 17 ms. Remains 104 /152 variables (removed 48) and now considering 254/384 (removed 130) transitions.
[2022-06-10 06:27:37] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:37] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-06-10 06:27:37] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:37] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2022-06-10 06:27:37] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 104 cols
[2022-06-10 06:27:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-10 06:27:37] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/152 places, 254/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/152 places, 254/384 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(OR (LT s0 1) (LT s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 981 reset in 364 ms.
Product exploration explored 100000 steps with 991 reset in 398 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 4340 steps, including 3 resets, run visited all 1 properties in 9 ms. (steps per millisecond=482 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 254/254 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 250
Applied a total of 4 rules in 18 ms. Remains 104 /104 variables (removed 0) and now considering 250/254 (removed 4) transitions.
[2022-06-10 06:27:39] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 104 cols
[2022-06-10 06:27:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 06:27:39] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 104 cols
[2022-06-10 06:27:39] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-10 06:27:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:39] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-06-10 06:27:39] [INFO ] Redundant transitions in 14 ms returned []
[2022-06-10 06:27:39] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 104 cols
[2022-06-10 06:27:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/104 places, 250/254 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 250/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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 6327 steps, including 3 resets, run visited all 1 properties in 14 ms. (steps per millisecond=451 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 945 reset in 317 ms.
Product exploration explored 100000 steps with 1001 reset in 262 ms.
Built C files in :
/tmp/ltsmin12062009308502273680
[2022-06-10 06:27:40] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-06-10 06:27:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:40] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-06-10 06:27:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:40] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-06-10 06:27:40] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:40] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12062009308502273680
Running compilation step : cd /tmp/ltsmin12062009308502273680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 609 ms.
Running link step : cd /tmp/ltsmin12062009308502273680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12062009308502273680;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10580603589508266687.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 250/250 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 248
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 246
Applied a total of 4 rules in 15 ms. Remains 103 /104 variables (removed 1) and now considering 246/250 (removed 4) transitions.
[2022-06-10 06:27:55] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:27:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 06:27:55] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:27:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:27:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:27:56] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2022-06-10 06:27:56] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:27:56] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:27:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:27:56] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/104 places, 246/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/104 places, 246/250 transitions.
Built C files in :
/tmp/ltsmin12761216913504316196
[2022-06-10 06:27:56] [INFO ] Computing symmetric may disable matrix : 246 transitions.
[2022-06-10 06:27:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:56] [INFO ] Computing symmetric may enable matrix : 246 transitions.
[2022-06-10 06:27:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:56] [INFO ] Computing Do-Not-Accords matrix : 246 transitions.
[2022-06-10 06:27:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:27:56] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12761216913504316196
Running compilation step : cd /tmp/ltsmin12761216913504316196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 461 ms.
Running link step : cd /tmp/ltsmin12761216913504316196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12761216913504316196;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased856432885586746506.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-10 06:28:11] [INFO ] Flatten gal took : 13 ms
[2022-06-10 06:28:11] [INFO ] Flatten gal took : 14 ms
[2022-06-10 06:28:11] [INFO ] Time to serialize gal into /tmp/LTL8903411164374736096.gal : 3 ms
[2022-06-10 06:28:11] [INFO ] Time to serialize properties into /tmp/LTL45572902870258157.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8903411164374736096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL45572902870258157.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8903411...264
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((s0<1)||(l157<1))")))||("((s1>=1)&&(l190>=1))"))))
Formula 0 simplified : !X("((s1>=1)&&(l190>=1))" | FG"((s0<1)||(l157<1))")
Detected timeout of ITS tools.
[2022-06-10 06:28:26] [INFO ] Flatten gal took : 17 ms
[2022-06-10 06:28:26] [INFO ] Applying decomposition
[2022-06-10 06:28:26] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7544690334321063204.txt' '-o' '/tmp/graph7544690334321063204.bin' '-w' '/tmp/graph7544690334321063204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7544690334321063204.bin' '-l' '-1' '-v' '-w' '/tmp/graph7544690334321063204.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:28:26] [INFO ] Decomposing Gal with order
[2022-06-10 06:28:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:28:26] [INFO ] Removed a total of 413 redundant transitions.
[2022-06-10 06:28:26] [INFO ] Flatten gal took : 115 ms
[2022-06-10 06:28:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 29 ms.
[2022-06-10 06:28:26] [INFO ] Time to serialize gal into /tmp/LTL1700244224614734674.gal : 24 ms
[2022-06-10 06:28:26] [INFO ] Time to serialize properties into /tmp/LTL901409850664777414.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1700244224614734674.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL901409850664777414.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1700244...244
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i0.u0.s0<1)||(i9.i0.u22.l157<1))")))||("((i1.u1.s1>=1)&&(i9.i1.u24.l190>=1))"))))
Formula 0 simplified : !X("((i1.u1.s1>=1)&&(i9.i1.u24.l190>=1))" | FG"((i0.u0.s0<1)||(i9.i0.u22.l157<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10843568208671759300
[2022-06-10 06:28:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10843568208671759300
Running compilation step : cd /tmp/ltsmin10843568208671759300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin10843568208671759300;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10843568208671759300;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-b064-LTLFireability-06 finished in 79564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((F(X(G(F(p1))))&&p0)))))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 139 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 139 transition count 346
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 139 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 132 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 132 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 125 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 120 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 110 transition count 264
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 110 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 108 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 108 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 102 place count 106 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 104 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 103 transition count 250
Applied a total of 110 rules in 19 ms. Remains 103 /152 variables (removed 49) and now considering 250/384 (removed 134) transitions.
[2022-06-10 06:28:56] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:28:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-06-10 06:28:57] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:28:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:28:57] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-06-10 06:28:57] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:28:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:57] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/152 places, 250/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/152 places, 250/384 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s98 1)), p0:(AND (GEQ s1 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-07 finished in 638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 139 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 139 transition count 346
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 139 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 132 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 132 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 59 place count 125 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 66 place count 125 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 120 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 115 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 115 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 110 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 110 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 107 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 107 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 104 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 102 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 101 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 100 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 100 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 100 transition count 240
Applied a total of 118 rules in 50 ms. Remains 100 /152 variables (removed 52) and now considering 240/384 (removed 144) transitions.
[2022-06-10 06:28:57] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2022-06-10 06:28:57] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:28:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-06-10 06:28:57] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2022-06-10 06:28:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-06-10 06:28:57] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2022-06-10 06:28:57] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-10 06:28:57] [INFO ] Flow matrix only has 164 transitions (discarded 76 similar events)
// Phase 1: matrix 164 rows 100 cols
[2022-06-10 06:28:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:58] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/152 places, 240/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/152 places, 240/384 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1100 reset in 250 ms.
Stack based approach found an accepted trace after 94999 steps with 1001 reset with depth 79 and stack size 79 in 257 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-09 finished in 1095 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 348
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 348
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 140 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 134 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 134 transition count 322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 128 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 113 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 108 transition count 264
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 108 transition count 260
Applied a total of 104 rules in 39 ms. Remains 108 /152 variables (removed 44) and now considering 260/384 (removed 124) transitions.
[2022-06-10 06:28:58] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 06:28:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2022-06-10 06:28:58] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 06:28:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-10 06:28:58] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-06-10 06:28:58] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-10 06:28:58] [INFO ] Flow matrix only has 177 transitions (discarded 83 similar events)
// Phase 1: matrix 177 rows 108 cols
[2022-06-10 06:28:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:28:59] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/152 places, 260/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/152 places, 260/384 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-10 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 s4 1) (GEQ s97 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 23 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-10 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((F(p0)||G(p1)||p1)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 141 transition count 350
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 141 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 135 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 130 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 130 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 125 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 125 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 120 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 120 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 115 transition count 278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 86 place count 113 transition count 274
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 111 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 107 transition count 262
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 107 transition count 258
Applied a total of 104 rules in 41 ms. Remains 107 /152 variables (removed 45) and now considering 258/384 (removed 126) transitions.
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-10 06:28:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-06-10 06:28:59] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2022-06-10 06:28:59] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-10 06:28:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/152 places, 258/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/152 places, 258/384 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-12 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:(AND (GEQ s0 1) (GEQ s94 1)), p0:(AND (GEQ s1 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-12 finished in 415 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 140 transition count 350
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 140 transition count 350
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 36 place count 140 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 134 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 134 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 128 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 123 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 123 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 118 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 113 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 113 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 110 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 110 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 107 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 103 transition count 250
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 103 transition count 246
Applied a total of 114 rules in 31 ms. Remains 103 /152 variables (removed 49) and now considering 246/384 (removed 138) transitions.
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:59] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:28:59] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-10 06:28:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
// Phase 1: matrix 168 rows 103 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:28:59] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/152 places, 246/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/152 places, 246/384 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-13 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(G(p1))&&p0)))&&F(p2))))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 141 transition count 350
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 141 transition count 350
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 32 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 135 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 135 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 129 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 129 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 123 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 123 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 117 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 117 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 111 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 95 place count 108 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 98 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 103 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 102 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 102 transition count 248
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 102 transition count 246
Applied a total of 112 rules in 27 ms. Remains 102 /152 variables (removed 50) and now considering 246/384 (removed 138) transitions.
[2022-06-10 06:28:59] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 06:28:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2022-06-10 06:29:00] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 06:29:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-06-10 06:29:00] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-10 06:29:00] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-10 06:29:00] [INFO ] Flow matrix only has 169 transitions (discarded 77 similar events)
// Phase 1: matrix 169 rows 102 cols
[2022-06-10 06:29:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 102/152 places, 246/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/152 places, 246/384 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s77 1)), p1:(AND (GEQ s1 1) (GEQ s75 1)), p0:(AND (GEQ s1 1) (GEQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-14 finished in 468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||p1))))'
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 384/384 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 139 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 139 transition count 346
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 139 transition count 334
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 132 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 132 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 126 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 116 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 116 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 111 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 111 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 109 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 109 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 107 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 105 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 104 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 104 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 103 transition count 250
Applied a total of 110 rules in 16 ms. Remains 103 /152 variables (removed 49) and now considering 250/384 (removed 134) transitions.
[2022-06-10 06:29:00] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:29:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-06-10 06:29:00] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:29:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-06-10 06:29:00] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2022-06-10 06:29:00] [INFO ] Flow matrix only has 170 transitions (discarded 80 similar events)
// Phase 1: matrix 170 rows 103 cols
[2022-06-10 06:29:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-10 06:29:00] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/152 places, 250/384 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/152 places, 250/384 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b064-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s81 1)), p0:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b064-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b064-LTLFireability-15 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||p1)))'
[2022-06-10 06:29:01] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17363573332964397470
[2022-06-10 06:29:01] [INFO ] Computing symmetric may disable matrix : 384 transitions.
[2022-06-10 06:29:01] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:29:01] [INFO ] Applying decomposition
[2022-06-10 06:29:01] [INFO ] Computing symmetric may enable matrix : 384 transitions.
[2022-06-10 06:29:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:29:01] [INFO ] Computing Do-Not-Accords matrix : 384 transitions.
[2022-06-10 06:29:01] [INFO ] Flatten gal took : 17 ms
[2022-06-10 06:29:01] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-10 06:29:01] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17363573332964397470
Running compilation step : cd /tmp/ltsmin17363573332964397470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2648271788338838767.txt' '-o' '/tmp/graph2648271788338838767.bin' '-w' '/tmp/graph2648271788338838767.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2648271788338838767.bin' '-l' '-1' '-v' '-w' '/tmp/graph2648271788338838767.weights' '-q' '0' '-e' '0.001'
[2022-06-10 06:29:01] [INFO ] Decomposing Gal with order
[2022-06-10 06:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-10 06:29:01] [INFO ] Removed a total of 640 redundant transitions.
[2022-06-10 06:29:01] [INFO ] Flatten gal took : 42 ms
[2022-06-10 06:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 24 ms.
[2022-06-10 06:29:01] [INFO ] Time to serialize gal into /tmp/LTLFireability6487026068133503228.gal : 4 ms
[2022-06-10 06:29:01] [INFO ] Time to serialize properties into /tmp/LTLFireability17123277598623625744.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6487026068133503228.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17123277598623625744.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((i5.i1.u1.s0<1)||(i12.u39.l157<1))")))||("((i1.u0.s1>=1)&&(i11.u40.l190>=1))"))))
Formula 0 simplified : !X("((i1.u0.s1>=1)&&(i11.u40.l190>=1))" | FG"((i5.i1.u1.s0<1)||(i12.u39.l157<1))")
Compilation finished in 851 ms.
Running link step : cd /tmp/ltsmin17363573332964397470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17363573332964397470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: LTL layer: formula: X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))
pins2lts-mc-linux64( 3/ 8), 0.008: "X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: There are 387 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.036: State length is 153, there are 391 groups
pins2lts-mc-linux64( 0/ 8), 0.036: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.036: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.036: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.036: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.122: [Blue] ~120 levels ~960 states ~4928 transitions
pins2lts-mc-linux64( 6/ 8), 0.162: [Blue] ~240 levels ~1920 states ~12160 transitions
pins2lts-mc-linux64( 3/ 8), 0.241: [Blue] ~480 levels ~3840 states ~16480 transitions
pins2lts-mc-linux64( 5/ 8), 0.391: [Blue] ~960 levels ~7680 states ~35232 transitions
pins2lts-mc-linux64( 3/ 8), 0.583: [Blue] ~1920 levels ~15360 states ~60256 transitions
pins2lts-mc-linux64( 3/ 8), 0.928: [Blue] ~3840 levels ~30720 states ~118624 transitions
pins2lts-mc-linux64( 0/ 8), 1.432: [Blue] ~5649 levels ~61440 states ~273728 transitions
pins2lts-mc-linux64( 5/ 8), 2.128: [Blue] ~15360 levels ~122880 states ~524832 transitions
pins2lts-mc-linux64( 3/ 8), 3.086: [Blue] ~30720 levels ~245760 states ~935776 transitions
pins2lts-mc-linux64( 3/ 8), 4.636: [Blue] ~61440 levels ~491520 states ~1869664 transitions
pins2lts-mc-linux64( 1/ 8), 7.519: [Blue] ~122880 levels ~983040 states ~3934968 transitions
pins2lts-mc-linux64( 3/ 8), 13.473: [Blue] ~245760 levels ~1966080 states ~7472992 transitions
pins2lts-mc-linux64( 3/ 8), 25.263: [Blue] ~491520 levels ~3932160 states ~14944096 transitions
pins2lts-mc-linux64( 3/ 8), 50.241: [Blue] ~983040 levels ~7864320 states ~29886304 transitions
pins2lts-mc-linux64( 4/ 8), 53.659: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 53.772:
pins2lts-mc-linux64( 0/ 8), 53.772: Explored 7736678 states 35333382 transitions, fanout: 4.567
pins2lts-mc-linux64( 0/ 8), 53.772: Total exploration time 53.720 sec (53.610 sec minimum, 53.668 sec on average)
pins2lts-mc-linux64( 0/ 8), 53.772: States per second: 144019, Transitions per second: 657732
pins2lts-mc-linux64( 0/ 8), 53.772:
pins2lts-mc-linux64( 0/ 8), 53.772: State space has 34128765 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 53.772: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 53.773: blue states: 7736678 (22.67%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 53.773: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 53.773: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 53.773:
pins2lts-mc-linux64( 0/ 8), 53.773: Total memory used for local state coloring: 111.5MB
pins2lts-mc-linux64( 0/ 8), 53.773:
pins2lts-mc-linux64( 0/ 8), 53.773: Queue width: 8B, total height: 7307352, memory: 55.75MB
pins2lts-mc-linux64( 0/ 8), 53.773: Tree memory: 516.4MB, 15.9 B/state, compr.: 2.6%
pins2lts-mc-linux64( 0/ 8), 53.773: Tree fill ratio (roots/leafs): 25.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 53.773: Stored 386 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 53.773: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 53.773: Est. total memory use: 572.1MB (~1079.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17363573332964397470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17363573332964397470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>([]((LTLAPp0==true)))||(LTLAPp1==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-06-10 06:49:30] [INFO ] Flatten gal took : 16 ms
[2022-06-10 06:49:30] [INFO ] Time to serialize gal into /tmp/LTLFireability8055437351375401250.gal : 2 ms
[2022-06-10 06:49:30] [INFO ] Time to serialize properties into /tmp/LTLFireability16154961484123782381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8055437351375401250.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16154961484123782381.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((s0<1)||(l157<1))")))||("((s1>=1)&&(l190>=1))"))))
Formula 0 simplified : !X("((s1>=1)&&(l190>=1))" | FG"((s0<1)||(l157<1))")
Detected timeout of ITS tools.
[2022-06-10 07:10:01] [INFO ] Flatten gal took : 348 ms
[2022-06-10 07:10:01] [INFO ] Input system was already deterministic with 384 transitions.
[2022-06-10 07:10:02] [INFO ] Transformed 152 places.
[2022-06-10 07:10:02] [INFO ] Transformed 384 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-10 07:10:02] [INFO ] Time to serialize gal into /tmp/LTLFireability5704830788701920523.gal : 7 ms
[2022-06-10 07:10:02] [INFO ] Time to serialize properties into /tmp/LTLFireability1007820156939567205.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5704830788701920523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1007820156939567205.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F(G("((s0<1)||(l157<1))")))||("((s1>=1)&&(l190>=1))"))))
Formula 0 simplified : !X("((s1>=1)&&(l190>=1))" | FG"((s0<1)||(l157<1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-b064"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b064, 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 r312-tall-165472282300460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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