About the Execution of ITS-Tools for IBMB2S565S3960-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2863.840 | 294891.00 | 974426.00 | 1281.60 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r121-tall-162075406800349.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is IBMB2S565S3960-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406800349
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 38K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 23 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 01:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K May 5 16:51 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 IBMB2S565S3960-PT-none-00
FORMULA_NAME IBMB2S565S3960-PT-none-01
FORMULA_NAME IBMB2S565S3960-PT-none-02
FORMULA_NAME IBMB2S565S3960-PT-none-03
FORMULA_NAME IBMB2S565S3960-PT-none-04
FORMULA_NAME IBMB2S565S3960-PT-none-05
FORMULA_NAME IBMB2S565S3960-PT-none-06
FORMULA_NAME IBMB2S565S3960-PT-none-07
FORMULA_NAME IBMB2S565S3960-PT-none-08
FORMULA_NAME IBMB2S565S3960-PT-none-09
FORMULA_NAME IBMB2S565S3960-PT-none-10
FORMULA_NAME IBMB2S565S3960-PT-none-11
FORMULA_NAME IBMB2S565S3960-PT-none-12
FORMULA_NAME IBMB2S565S3960-PT-none-13
FORMULA_NAME IBMB2S565S3960-PT-none-14
FORMULA_NAME IBMB2S565S3960-PT-none-15
=== Now, execution of the tool begins
BK_START 1620837957070
Running Version 0
[2021-05-12 16:45:58] [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]
[2021-05-12 16:45:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 16:45:58] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-12 16:45:58] [INFO ] Transformed 273 places.
[2021-05-12 16:45:58] [INFO ] Transformed 179 transitions.
[2021-05-12 16:45:58] [INFO ] Parsed PT model containing 273 places and 179 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 16:45:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA IBMB2S565S3960-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 179/179 transitions.
Ensure Unique test removed 83 places
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 180 transition count 178
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 109 place count 165 transition count 163
Iterating global reduction 1 with 15 rules applied. Total rules applied 124 place count 165 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 163 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 163 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 162 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 162 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 161 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 161 transition count 159
Applied a total of 132 rules in 60 ms. Remains 161 /273 variables (removed 112) and now considering 159/179 (removed 20) transitions.
// Phase 1: matrix 159 rows 161 cols
[2021-05-12 16:45:59] [INFO ] Computed 14 place invariants in 14 ms
[2021-05-12 16:45:59] [INFO ] Implicit Places using invariants in 118 ms returned [129]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
// Phase 1: matrix 159 rows 160 cols
[2021-05-12 16:45:59] [INFO ] Computed 13 place invariants in 3 ms
[2021-05-12 16:45:59] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Starting structural reductions, iteration 1 : 160/273 places, 159/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 160 cols
[2021-05-12 16:45:59] [INFO ] Computed 13 place invariants in 14 ms
[2021-05-12 16:45:59] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 2 iterations. Remains : 160/273 places, 159/179 transitions.
[2021-05-12 16:45:59] [INFO ] Flatten gal took : 37 ms
[2021-05-12 16:45:59] [INFO ] Flatten gal took : 14 ms
[2021-05-12 16:45:59] [INFO ] Input system was already deterministic with 159 transitions.
Incomplete random walk after 100000 steps, including 397 resets, run finished after 223 ms. (steps per millisecond=448 ) properties (out of 31) seen :29
Running SMT prover for 2 properties.
// Phase 1: matrix 159 rows 160 cols
[2021-05-12 16:45:59] [INFO ] Computed 13 place invariants in 10 ms
[2021-05-12 16:45:59] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-12 16:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:46:00] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-12 16:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:46:00] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-12 16:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:46:00] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 16:46:00] [INFO ] Computed and/alt/rep : 158/198/158 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-12 16:46:00] [INFO ] Added : 105 causal constraints over 23 iterations in 281 ms. Result :sat
[2021-05-12 16:46:00] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-12 16:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 16:46:00] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-12 16:46:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 16:46:00] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-12 16:46:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 16:46:00] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 16:46:00] [INFO ] Computed and/alt/rep : 158/198/158 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 16:46:00] [INFO ] Added : 113 causal constraints over 24 iterations in 231 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 146 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 146 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 145 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 145 transition count 150
Applied a total of 24 rules in 15 ms. Remains 145 /160 variables (removed 15) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 145 cols
[2021-05-12 16:46:00] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-12 16:46:00] [INFO ] Implicit Places using invariants in 47 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:00] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 16:46:01] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Starting structural reductions, iteration 1 : 144/160 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 149
Applied a total of 2 rules in 10 ms. Remains 143 /144 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 143 cols
[2021-05-12 16:46:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 149 rows 143 cols
[2021-05-12 16:46:01] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 143/160 places, 149/159 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s38 1), p1:(AND (GEQ s137 1) (GEQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA IBMB2S565S3960-PT-none-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-00 finished in 504 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Graph (trivial) has 120 edges and 160 vertex of which 18 / 160 are part of one of the 1 SCC in 3 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Ensure Unique test removed 8 places
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 135 transition count 73
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 136 place count 68 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 67 transition count 72
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 137 place count 67 transition count 50
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 183 place count 43 transition count 50
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 42 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 188 place count 40 transition count 48
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 192 place count 36 transition count 44
Iterating global reduction 5 with 4 rules applied. Total rules applied 196 place count 36 transition count 44
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 25 rules applied. Total rules applied 221 place count 23 transition count 32
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 226 place count 23 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 22 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 20 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 233 place count 20 transition count 26
Applied a total of 233 rules in 24 ms. Remains 20 /160 variables (removed 140) and now considering 26/159 (removed 133) transitions.
// Phase 1: matrix 26 rows 20 cols
[2021-05-12 16:46:01] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-12 16:46:01] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:46:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2021-05-12 16:46:01] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 26 rows 20 cols
[2021-05-12 16:46:01] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:46:01] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/160 places, 26/159 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1)), p1:(OR (LT s9 1) (LT s10 1) (LT s11 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 227 steps with 22 reset in 4 ms.
FORMULA IBMB2S565S3960-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-01 finished in 214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&(p1||X((G(p2) U (p1&&G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 144 transition count 150
Applied a total of 25 rules in 13 ms. Remains 144 /160 variables (removed 16) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants in 33 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 150 rows 143 cols
[2021-05-12 16:46:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:46:01] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 143/160 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 15 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-12 16:46:01] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 142/160 places, 149/159 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-02 automaton TGBA [mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 6}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=6 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=4, aps=[p0:(LT s92 1), p1:(LT s91 1), p2:(GEQ s134 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3737 steps with 18 reset in 17 ms.
FORMULA IBMB2S565S3960-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-02 finished in 469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Graph (trivial) has 121 edges and 160 vertex of which 18 / 160 are part of one of the 1 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 134 transition count 72
Reduce places removed 67 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 67 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 139 place count 65 transition count 70
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 139 place count 65 transition count 47
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 187 place count 40 transition count 47
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 39 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 192 place count 37 transition count 45
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 196 place count 33 transition count 41
Iterating global reduction 5 with 4 rules applied. Total rules applied 200 place count 33 transition count 41
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 222 place count 22 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 226 place count 22 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 20 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 232 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 19 transition count 22
Ensure Unique test removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 235 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 237 place count 15 transition count 20
Applied a total of 237 rules in 12 ms. Remains 15 /160 variables (removed 145) and now considering 20/159 (removed 139) transitions.
// Phase 1: matrix 20 rows 15 cols
[2021-05-12 16:46:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 15 cols
[2021-05-12 16:46:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:46:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants and state equation in 18 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 31 ms to find 1 implicit places.
[2021-05-12 16:46:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 14 cols
[2021-05-12 16:46:02] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:02] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 14/160 places, 19/159 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2021-05-12 16:46:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 14 cols
[2021-05-12 16:46:02] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-12 16:46:02] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 14/160 places, 19/159 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1), p1:(LT s5 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 131 steps with 34 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-03 finished in 141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(G(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 152 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 145 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 145 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 143 transition count 149
Applied a total of 27 rules in 11 ms. Remains 143 /160 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2021-05-12 16:46:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants in 28 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:02] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:02] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 142/160 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 5 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:46:02] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:46:02] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 141/160 places, 148/159 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, true, p0]
Running random walk in product with property : IBMB2S565S3960-PT-none-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 472 reset in 206 ms.
Entered a terminal (fully accepting) state of product in 91030 steps with 442 reset in 220 ms.
FORMULA IBMB2S565S3960-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-04 finished in 724 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G((X(p1)||(p2 U (p3||G(p2)))))||p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 154 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 148 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 148 transition count 153
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 147 transition count 152
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 146 transition count 151
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 146 transition count 151
Applied a total of 22 rules in 10 ms. Remains 146 /160 variables (removed 14) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 146 cols
[2021-05-12 16:46:02] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-12 16:46:02] [INFO ] Implicit Places using invariants in 36 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
// Phase 1: matrix 151 rows 145 cols
[2021-05-12 16:46:02] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 16:46:03] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Starting structural reductions, iteration 1 : 145/160 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 144 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 144 transition count 150
Applied a total of 2 rules in 3 ms. Remains 144 /145 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:03] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 16:46:03] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:03] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 16:46:03] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 144/160 places, 150/159 transitions.
Stuttering acceptance computed with spot in 3517 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : IBMB2S565S3960-PT-none-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s134 1) (LT s135 1)), p3:(AND (OR (LT s134 1) (LT s135 1)) (LT s29 1)), p1:(AND (GEQ s66 1) (GEQ s67 1)), p2:(LT s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 741 reset in 193 ms.
Product exploration explored 100000 steps with 722 reset in 194 ms.
Graph (complete) has 170 edges and 144 vertex of which 100 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p3, (NOT p1), p2]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 738 reset in 137 ms.
Product exploration explored 100000 steps with 705 reset in 150 ms.
[2021-05-12 16:46:07] [INFO ] Flatten gal took : 9 ms
[2021-05-12 16:46:07] [INFO ] Flatten gal took : 12 ms
[2021-05-12 16:46:07] [INFO ] Time to serialize gal into /tmp/LTL15933996123047767444.gal : 7 ms
[2021-05-12 16:46:07] [INFO ] Time to serialize properties into /tmp/LTL3845360178307983343.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15933996123047767444.gal, -t, CGAL, -LTL, /tmp/LTL3845360178307983343.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15933996123047767444.gal -t CGAL -LTL /tmp/LTL3845360178307983343.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("((merge.s00001162.input.s00001129<1)||(merge.s00001162.input.s00001299<1))")||(G((X("((callToTask.s00003976.output.s00001054>=1)&&(callToTask.s00003976.output.s00001077>=1))"))||(("(callToTask.s00003908.inputCriterion.s00001053.used<1)")U(("(((merge.s00001162.input.s00001129<1)||(merge.s00001162.input.s00001299<1))&&(callToTask.s00003908.inputCriterion.s00001053.used<1))")||(G("(callToTask.s00003908.inputCriterion.s00001053.used<1)"))))))))))
Formula 0 simplified : !GF("((merge.s00001162.input.s00001129<1)||(merge.s00001162.input.s00001299<1))" | G(X"((callToTask.s00003976.output.s00001054>=1)&&(callToTask.s00003976.output.s00001077>=1))" | ("(callToTask.s00003908.inputCriterion.s00001053.used<1)" U ("(((merge.s00001162.input.s00001129<1)||(merge.s00001162.input.s00001299<1))&&(callToTask.s00003908.inputCriterion.s00001053.used<1))" | G"(callToTask.s00003908.inputCriterion.s00001053.used<1)"))))
Detected timeout of ITS tools.
[2021-05-12 16:46:22] [INFO ] Flatten gal took : 7 ms
[2021-05-12 16:46:22] [INFO ] Applying decomposition
[2021-05-12 16:46:22] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15501722413766072022.txt, -o, /tmp/graph15501722413766072022.bin, -w, /tmp/graph15501722413766072022.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15501722413766072022.bin, -l, -1, -v, -w, /tmp/graph15501722413766072022.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:46:22] [INFO ] Decomposing Gal with order
[2021-05-12 16:46:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:46:22] [INFO ] Removed a total of 13 redundant transitions.
[2021-05-12 16:46:23] [INFO ] Flatten gal took : 36 ms
[2021-05-12 16:46:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-12 16:46:23] [INFO ] Time to serialize gal into /tmp/LTL10451297689982060973.gal : 4 ms
[2021-05-12 16:46:23] [INFO ] Time to serialize properties into /tmp/LTL3077374805887579381.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10451297689982060973.gal, -t, CGAL, -LTL, /tmp/LTL3077374805887579381.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10451297689982060973.gal -t CGAL -LTL /tmp/LTL3077374805887579381.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i1.u54.merge.s00001162.input.s00001129<1)||(i1.i1.u54.merge.s00001162.input.s00001299<1))")||(G((X("((i7.u57.callToTask.s00003976.output.s00001054>=1)&&(i7.u24.callToTask.s00003976.output.s00001077>=1))"))||(("(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)")U(("(((i1.i1.u54.merge.s00001162.input.s00001129<1)||(i1.i1.u54.merge.s00001162.input.s00001299<1))&&(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1))")||(G("(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)"))))))))))
Formula 0 simplified : !GF("((i1.i1.u54.merge.s00001162.input.s00001129<1)||(i1.i1.u54.merge.s00001162.input.s00001299<1))" | G(X"((i7.u57.callToTask.s00003976.output.s00001054>=1)&&(i7.u24.callToTask.s00003976.output.s00001077>=1))" | ("(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)" U ("(((i1.i1.u54.merge.s00001162.input.s00001129<1)||(i1.i1.u54.merge.s00001162.input.s00001299<1))&&(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1))" | G"(i8.i0.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)"))))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17958181974308115013
[2021-05-12 16:46:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17958181974308115013
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin17958181974308115013]
Compilation finished in 645 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17958181974308115013]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(([]((X((LTLAPp1==true))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17958181974308115013]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property IBMB2S565S3960-PT-none-05 finished in 50141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 152 transition count 79
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 73 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 71 transition count 77
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 162 place count 71 transition count 51
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 216 place count 43 transition count 51
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 218 place count 42 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 41 transition count 50
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 223 place count 37 transition count 46
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 37 transition count 46
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 249 place count 26 transition count 35
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 254 place count 26 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 25 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 257 place count 25 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 263 place count 22 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 264 place count 22 transition count 37
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 272 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 273 place count 21 transition count 28
Ensure Unique test removed 2 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 275 place count 19 transition count 28
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 276 place count 18 transition count 23
Iterating global reduction 9 with 1 rules applied. Total rules applied 277 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 278 place count 17 transition count 22
Applied a total of 278 rules in 12 ms. Remains 17 /160 variables (removed 143) and now considering 22/159 (removed 137) transitions.
// Phase 1: matrix 22 rows 17 cols
[2021-05-12 16:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 22 rows 17 cols
[2021-05-12 16:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned [7]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 33 ms to find 1 implicit places.
[2021-05-12 16:46:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2021-05-12 16:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:46:53] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 16/160 places, 21/159 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 20
Applied a total of 1 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 16 cols
[2021-05-12 16:46:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 16 cols
[2021-05-12 16:46:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 16/160 places, 20/159 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s5 1)), p1:(AND (LT s6 1) (OR (LT s4 1) (LT s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5247 reset in 224 ms.
Stack based approach found an accepted trace after 72 steps with 3 reset with depth 19 and stack size 19 in 1 ms.
FORMULA IBMB2S565S3960-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-07 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p1 U p2)&&p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 152 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 145 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 145 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 144 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 143 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 143 transition count 149
Applied a total of 27 rules in 6 ms. Remains 143 /160 variables (removed 17) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 143 cols
[2021-05-12 16:46:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 51 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Starting structural reductions, iteration 1 : 142/160 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 148
Applied a total of 2 rules in 9 ms. Remains 141 /142 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:46:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 148 rows 141 cols
[2021-05-12 16:46:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 141/160 places, 148/159 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : IBMB2S565S3960-PT-none-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s106 1) (GEQ s95 1) (LT s82 1)), p2:(GEQ s106 1), p1:(GEQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-08 finished in 362 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0)) U (F(p1)&&(p2 U p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 153 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 12 place count 148 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 148 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 148 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 147 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 147 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 146 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 146 transition count 151
Applied a total of 22 rules in 5 ms. Remains 146 /160 variables (removed 14) and now considering 151/159 (removed 8) transitions.
// Phase 1: matrix 151 rows 146 cols
[2021-05-12 16:46:53] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 28 ms returned [133]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 151 rows 145 cols
[2021-05-12 16:46:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 145/160 places, 151/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 144 transition count 150
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 144 transition count 150
Applied a total of 2 rules in 10 ms. Remains 144 /145 variables (removed 1) and now considering 150/151 (removed 1) transitions.
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:53] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 144/160 places, 150/159 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IBMB2S565S3960-PT-none-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s11 1)), p0:(GEQ s134 1), p2:(GEQ s135 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 163 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-09 finished in 320 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 8 places
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 152 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 14 place count 146 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 146 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 146 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 145 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 145 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 144 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 144 transition count 150
Applied a total of 25 rules in 7 ms. Remains 144 /160 variables (removed 16) and now considering 150/159 (removed 9) transitions.
// Phase 1: matrix 150 rows 144 cols
[2021-05-12 16:46:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 49 ms returned [132]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
// Phase 1: matrix 150 rows 143 cols
[2021-05-12 16:46:54] [INFO ] Computed 4 place invariants in 7 ms
[2021-05-12 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 143/160 places, 150/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 142 transition count 149
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 149
Applied a total of 2 rules in 3 ms. Remains 142 /143 variables (removed 1) and now considering 149/150 (removed 1) transitions.
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 149 rows 142 cols
[2021-05-12 16:46:54] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 142/160 places, 149/159 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s133 1), p0:(GEQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-10 finished in 323 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((p0 U p1))&&(X(p2)||F(p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 154 transition count 159
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 147 transition count 152
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 147 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 147 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 146 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 146 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 145 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 145 transition count 149
Applied a total of 25 rules in 5 ms. Remains 145 /160 variables (removed 15) and now considering 149/159 (removed 10) transitions.
// Phase 1: matrix 149 rows 145 cols
[2021-05-12 16:46:54] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 25 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
// Phase 1: matrix 149 rows 144 cols
[2021-05-12 16:46:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 144/160 places, 149/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 148
Applied a total of 2 rules in 2 ms. Remains 143 /144 variables (removed 1) and now considering 148/149 (removed 1) transitions.
// Phase 1: matrix 148 rows 143 cols
[2021-05-12 16:46:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 148 rows 143 cols
[2021-05-12 16:46:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 143/160 places, 148/159 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : IBMB2S565S3960-PT-none-11 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LT s14 1), p1:(AND (LT s14 1) (GEQ s71 1) (GEQ s72 1)), p2:(AND (GEQ s116 1) (GEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-11 finished in 372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Graph (trivial) has 124 edges and 160 vertex of which 18 / 160 are part of one of the 1 SCC in 1 ms
Free SCC test removed 17 places
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 134 transition count 70
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 65 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 64 transition count 69
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 141 place count 64 transition count 47
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 186 place count 41 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 186 place count 41 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 39 transition count 46
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 38 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 192 place count 37 transition count 45
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 196 place count 33 transition count 41
Iterating global reduction 5 with 4 rules applied. Total rules applied 200 place count 33 transition count 41
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 220 place count 23 transition count 31
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 224 place count 23 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 230 place count 20 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 231 place count 20 transition count 36
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 239 place count 20 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 19 transition count 27
Ensure Unique test removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 242 place count 17 transition count 27
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 243 place count 16 transition count 22
Iterating global reduction 8 with 1 rules applied. Total rules applied 244 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 245 place count 15 transition count 21
Applied a total of 245 rules in 10 ms. Remains 15 /160 variables (removed 145) and now considering 21/159 (removed 138) transitions.
// Phase 1: matrix 21 rows 15 cols
[2021-05-12 16:46:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 21 rows 15 cols
[2021-05-12 16:46:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned [4]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 28 ms to find 1 implicit places.
[2021-05-12 16:46:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 14 cols
[2021-05-12 16:46:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 14/160 places, 20/159 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 19
Applied a total of 1 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 14 cols
[2021-05-12 16:46:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 19 rows 14 cols
[2021-05-12 16:46:54] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:54] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/160 places, 19/159 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s4 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 10 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-12 finished in 113 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 154 transition count 159
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 149 transition count 154
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 149 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 149 transition count 153
Applied a total of 17 rules in 3 ms. Remains 149 /160 variables (removed 11) and now considering 153/159 (removed 6) transitions.
// Phase 1: matrix 153 rows 149 cols
[2021-05-12 16:46:54] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 34 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
// Phase 1: matrix 153 rows 148 cols
[2021-05-12 16:46:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:46:55] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Starting structural reductions, iteration 1 : 148/160 places, 153/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 152
Applied a total of 2 rules in 4 ms. Remains 147 /148 variables (removed 1) and now considering 152/153 (removed 1) transitions.
// Phase 1: matrix 152 rows 147 cols
[2021-05-12 16:46:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 152 rows 147 cols
[2021-05-12 16:46:55] [INFO ] Computed 6 place invariants in 7 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 147/160 places, 152/159 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (GEQ s141 1) (GEQ s143 1)), p0:(AND (GEQ s44 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 337 steps with 1 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-13 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 153 transition count 159
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 147 transition count 153
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 147 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 147 transition count 152
Applied a total of 20 rules in 3 ms. Remains 147 /160 variables (removed 13) and now considering 152/159 (removed 7) transitions.
// Phase 1: matrix 152 rows 147 cols
[2021-05-12 16:46:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 29 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
// Phase 1: matrix 152 rows 146 cols
[2021-05-12 16:46:55] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Starting structural reductions, iteration 1 : 146/160 places, 152/159 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 145 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 145 transition count 151
Applied a total of 2 rules in 2 ms. Remains 145 /146 variables (removed 1) and now considering 151/152 (removed 1) transitions.
// Phase 1: matrix 151 rows 145 cols
[2021-05-12 16:46:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 151 rows 145 cols
[2021-05-12 16:46:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 145/160 places, 151/159 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : IBMB2S565S3960-PT-none-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s121 1) (GEQ s122 1)), p1:(AND (GEQ s44 1) (GEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA IBMB2S565S3960-PT-none-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-14 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 159/159 transitions.
Graph (trivial) has 121 edges and 160 vertex of which 12 / 160 are part of one of the 1 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Ensure Unique test removed 8 places
Reduce places removed 9 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 140 transition count 72
Reduce places removed 74 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 66 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 65 transition count 71
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 151 place count 65 transition count 48
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 199 place count 40 transition count 48
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 202 place count 39 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 204 place count 37 transition count 46
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 208 place count 33 transition count 42
Iterating global reduction 5 with 4 rules applied. Total rules applied 212 place count 33 transition count 42
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 232 place count 23 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 236 place count 23 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 242 place count 20 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 243 place count 20 transition count 37
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 251 place count 20 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 252 place count 19 transition count 28
Ensure Unique test removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 254 place count 17 transition count 28
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 255 place count 16 transition count 23
Iterating global reduction 8 with 1 rules applied. Total rules applied 256 place count 16 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 15 transition count 22
Applied a total of 257 rules in 25 ms. Remains 15 /160 variables (removed 145) and now considering 22/159 (removed 137) transitions.
// Phase 1: matrix 22 rows 15 cols
[2021-05-12 16:46:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 22 rows 15 cols
[2021-05-12 16:46:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned [6]
Discarding 1 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 27 ms to find 1 implicit places.
[2021-05-12 16:46:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 14 cols
[2021-05-12 16:46:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 14/160 places, 21/159 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 20
Applied a total of 1 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 14 cols
[2021-05-12 16:46:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 20 rows 14 cols
[2021-05-12 16:46:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-12 16:46:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-12 16:46:55] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 14/160 places, 20/159 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBMB2S565S3960-PT-none-15 automaton TGBA [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:(GEQ s5 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]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA IBMB2S565S3960-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBMB2S565S3960-PT-none-15 finished in 169 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6034147964387759506
[2021-05-12 16:46:55] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2021-05-12 16:46:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:46:55] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2021-05-12 16:46:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:46:55] [INFO ] Applying decomposition
[2021-05-12 16:46:55] [INFO ] Flatten gal took : 6 ms
[2021-05-12 16:46:55] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2021-05-12 16:46:55] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-12 16:46:55] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6034147964387759506
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6034147964387759506]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6646409821892467879.txt, -o, /tmp/graph6646409821892467879.bin, -w, /tmp/graph6646409821892467879.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6646409821892467879.bin, -l, -1, -v, -w, /tmp/graph6646409821892467879.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 16:46:55] [INFO ] Decomposing Gal with order
[2021-05-12 16:46:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 16:46:55] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-12 16:46:55] [INFO ] Flatten gal took : 12 ms
[2021-05-12 16:46:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-12 16:46:55] [INFO ] Time to serialize gal into /tmp/LTLFireability17708404061855135146.gal : 3 ms
[2021-05-12 16:46:55] [INFO ] Time to serialize properties into /tmp/LTLFireability1712779338628595980.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability17708404061855135146.gal, -t, CGAL, -LTL, /tmp/LTLFireability1712779338628595980.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability17708404061855135146.gal -t CGAL -LTL /tmp/LTLFireability1712779338628595980.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i2.u39.merge.s00001162.input.s00001129<1)||(i1.i2.u39.merge.s00001162.input.s00001299<1))")||(G((X("((i2.i0.u27.callToTask.s00003976.output.s00001054>=1)&&(i2.i0.u27.callToTask.s00003976.output.s00001077>=1))"))||(("(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)")U(("((!((i1.i2.u39.merge.s00001162.input.s00001129>=1)&&(i1.i2.u39.merge.s00001162.input.s00001299>=1)))&&(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1))")||(G("(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)"))))))))))
Formula 0 simplified : !GF("((i1.i2.u39.merge.s00001162.input.s00001129<1)||(i1.i2.u39.merge.s00001162.input.s00001299<1))" | G(X"((i2.i0.u27.callToTask.s00003976.output.s00001054>=1)&&(i2.i0.u27.callToTask.s00003976.output.s00001077>=1))" | ("(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)" U ("((!((i1.i2.u39.merge.s00001162.input.s00001129>=1)&&(i1.i2.u39.merge.s00001162.input.s00001299>=1)))&&(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1))" | G"(i8.i1.u12.callToTask.s00003908.inputCriterion.s00001053.used<1)"))))
Compilation finished in 698 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6034147964387759506]
Link finished in 45 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(([]((X((LTLAPp1==true))||((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))||(LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin6034147964387759506]
Reverse transition relation is NOT exact ! Due to transitions decision_s00001158_fire_s00001073, decision_s00001159_fire_s00001075, decision_s00002055_fire_s00001075, process_s00000565__s00003960_outputCriterion_s00001055, i1.join_s00001164_fire_s00001069, i1.i2.decision_s00002760_fire_s00001078, i1.i2.merge_s00001162_activate_s00001262, i1.i2.u39.decision.s00002760.fire.s00001075, i1.i2.u53.merge.s00001162.activate.s00001065, i5.merge_s00002240_activate_s00001062, i5.u40.decision.s00003020.fire.s00001073, i5.u40.decision.s00003020.fire.s00001075, i7.i0.callToTask_s00003963_outputCriterion_s00001055, i8.decision_s00001841_fire_s00001073, i8.decision_s00001840_fire_s00001073, i8.i0.callToProcess_s00001108_inputCriterion_s00001053, i8.i0.u0.callToProcess.s00001108.outputCriterion.s00001055, i8.i0.u0.callToTask.s00003961.inputCriterion.s00001053, i8.i0.u18.decision.s00002762.fire.s00001073, i9.i1.merge_s00002238_activate_s00001065, i9.i1.u6.callToProcess.s00003884.outputCriterion.s00001055, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/138/21/159
Computing Next relation with stutter on 3746 deadlock states
LTSmin run took 234134 ms.
FORMULA IBMB2S565S3960-PT-none-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1620838251961
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r121-tall-162075406800349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;