Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 27K Apr 30 03:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 30 03:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 30 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 256K Apr 30 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.9K May 9 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 9 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 9 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K May 9 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 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 PolyORBNT-PT-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652961483419

Running Version 202205111006
[2022-05-19 11:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:58:04] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-05-19 11:58:04] [INFO ] Transformed 629 places.
[2022-05-19 11:58:04] [INFO ] Transformed 1590 transitions.
[2022-05-19 11:58:04] [INFO ] Parsed PT model containing 629 places and 1590 transitions in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2022-05-19 11:58:04] [INFO ] Reduced 10 identical enabling conditions.
[2022-05-19 11:58:04] [INFO ] Reduced 10 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 440 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Applied a total of 5 rules in 44 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
[2022-05-19 11:58:05] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2022-05-19 11:58:05] [INFO ] Computed 97 place invariants in 82 ms
[2022-05-19 11:58:06] [INFO ] Dead Transitions using invariants and state equation in 1338 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2022-05-19 11:58:06] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 11:58:06] [INFO ] Computed 97 place invariants in 60 ms
[2022-05-19 11:58:07] [INFO ] Implicit Places using invariants in 666 ms returned []
[2022-05-19 11:58:07] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 11:58:07] [INFO ] Computed 97 place invariants in 22 ms
[2022-05-19 11:58:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:58:10] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3559 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/935 transitions.
Applied a total of 0 rules in 23 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 624/629 places, 840/935 transitions.
Support contains 440 out of 624 places after structural reductions.
[2022-05-19 11:58:10] [INFO ] Flatten gal took : 162 ms
[2022-05-19 11:58:10] [INFO ] Flatten gal took : 105 ms
[2022-05-19 11:58:10] [INFO ] Input system was already deterministic with 840 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 27) seen :22
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-05-19 11:58:11] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 11:58:11] [INFO ] Computed 97 place invariants in 29 ms
[2022-05-19 11:58:11] [INFO ] [Real]Absence check using 76 positive place invariants in 25 ms returned sat
[2022-05-19 11:58:11] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 23 ms returned sat
[2022-05-19 11:58:12] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-19 11:58:12] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2022-05-19 11:58:12] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2022-05-19 11:58:13] [INFO ] After 1721ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-19 11:58:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:58:14] [INFO ] After 610ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-19 11:58:14] [INFO ] Deduced a trap composed of 252 places in 232 ms of which 7 ms to minimize.
[2022-05-19 11:58:15] [INFO ] Deduced a trap composed of 261 places in 278 ms of which 1 ms to minimize.
[2022-05-19 11:58:15] [INFO ] Deduced a trap composed of 260 places in 265 ms of which 2 ms to minimize.
[2022-05-19 11:58:15] [INFO ] Deduced a trap composed of 242 places in 228 ms of which 1 ms to minimize.
[2022-05-19 11:58:16] [INFO ] Deduced a trap composed of 248 places in 214 ms of which 1 ms to minimize.
[2022-05-19 11:58:16] [INFO ] Deduced a trap composed of 257 places in 197 ms of which 1 ms to minimize.
[2022-05-19 11:58:16] [INFO ] Deduced a trap composed of 266 places in 207 ms of which 0 ms to minimize.
[2022-05-19 11:58:16] [INFO ] Deduced a trap composed of 270 places in 211 ms of which 1 ms to minimize.
[2022-05-19 11:58:16] [INFO ] Deduced a trap composed of 254 places in 189 ms of which 0 ms to minimize.
[2022-05-19 11:58:17] [INFO ] Deduced a trap composed of 263 places in 185 ms of which 0 ms to minimize.
[2022-05-19 11:58:17] [INFO ] Deduced a trap composed of 250 places in 199 ms of which 0 ms to minimize.
[2022-05-19 11:58:17] [INFO ] Deduced a trap composed of 265 places in 197 ms of which 0 ms to minimize.
[2022-05-19 11:58:18] [INFO ] Deduced a trap composed of 257 places in 190 ms of which 0 ms to minimize.
[2022-05-19 11:58:18] [INFO ] Deduced a trap composed of 252 places in 228 ms of which 0 ms to minimize.
[2022-05-19 11:58:18] [INFO ] Deduced a trap composed of 259 places in 211 ms of which 0 ms to minimize.
[2022-05-19 11:58:18] [INFO ] Deduced a trap composed of 264 places in 194 ms of which 1 ms to minimize.
[2022-05-19 11:58:19] [INFO ] Deduced a trap composed of 251 places in 184 ms of which 1 ms to minimize.
[2022-05-19 11:58:19] [INFO ] Deduced a trap composed of 246 places in 194 ms of which 1 ms to minimize.
[2022-05-19 11:58:19] [INFO ] Deduced a trap composed of 278 places in 193 ms of which 1 ms to minimize.
[2022-05-19 11:58:19] [INFO ] Deduced a trap composed of 260 places in 188 ms of which 2 ms to minimize.
[2022-05-19 11:58:20] [INFO ] Deduced a trap composed of 269 places in 179 ms of which 1 ms to minimize.
[2022-05-19 11:58:20] [INFO ] Deduced a trap composed of 254 places in 199 ms of which 1 ms to minimize.
[2022-05-19 11:58:20] [INFO ] Deduced a trap composed of 262 places in 181 ms of which 0 ms to minimize.
[2022-05-19 11:58:21] [INFO ] Deduced a trap composed of 266 places in 199 ms of which 0 ms to minimize.
[2022-05-19 11:58:21] [INFO ] Deduced a trap composed of 263 places in 190 ms of which 0 ms to minimize.
[2022-05-19 11:58:21] [INFO ] Deduced a trap composed of 269 places in 193 ms of which 0 ms to minimize.
[2022-05-19 11:58:22] [INFO ] Deduced a trap composed of 246 places in 192 ms of which 1 ms to minimize.
[2022-05-19 11:58:22] [INFO ] Deduced a trap composed of 258 places in 208 ms of which 1 ms to minimize.
[2022-05-19 11:58:22] [INFO ] Deduced a trap composed of 258 places in 186 ms of which 0 ms to minimize.
[2022-05-19 11:58:23] [INFO ] Deduced a trap composed of 263 places in 192 ms of which 0 ms to minimize.
[2022-05-19 11:58:23] [INFO ] Deduced a trap composed of 264 places in 198 ms of which 1 ms to minimize.
[2022-05-19 11:58:23] [INFO ] Deduced a trap composed of 270 places in 196 ms of which 0 ms to minimize.
[2022-05-19 11:58:23] [INFO ] Deduced a trap composed of 260 places in 183 ms of which 0 ms to minimize.
[2022-05-19 11:58:24] [INFO ] Deduced a trap composed of 263 places in 189 ms of which 1 ms to minimize.
[2022-05-19 11:58:24] [INFO ] Deduced a trap composed of 251 places in 190 ms of which 3 ms to minimize.
[2022-05-19 11:58:24] [INFO ] Deduced a trap composed of 245 places in 178 ms of which 1 ms to minimize.
[2022-05-19 11:58:24] [INFO ] Deduced a trap composed of 248 places in 202 ms of which 1 ms to minimize.
[2022-05-19 11:58:25] [INFO ] Deduced a trap composed of 253 places in 182 ms of which 0 ms to minimize.
[2022-05-19 11:58:26] [INFO ] Deduced a trap composed of 252 places in 187 ms of which 0 ms to minimize.
[2022-05-19 11:58:28] [INFO ] Deduced a trap composed of 281 places in 178 ms of which 2 ms to minimize.
[2022-05-19 11:58:37] [INFO ] Deduced a trap composed of 262 places in 205 ms of which 0 ms to minimize.
[2022-05-19 11:58:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 11:58:37] [INFO ] After 25221ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 172 ms. Remains 531 /624 variables (removed 93) and now considering 747/840 (removed 93) transitions.
[2022-05-19 11:58:37] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 11:58:37] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 11:58:38] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 531/624 places, 747/840 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2022-05-19 11:58:38] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2022-05-19 11:58:38] [INFO ] Computed 97 place invariants in 30 ms
[2022-05-19 11:58:38] [INFO ] [Real]Absence check using 76 positive place invariants in 21 ms returned sat
[2022-05-19 11:58:38] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2022-05-19 11:58:38] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:58:38] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2022-05-19 11:58:38] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2022-05-19 11:58:39] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:58:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:58:39] [INFO ] After 186ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:58:39] [INFO ] Deduced a trap composed of 182 places in 191 ms of which 0 ms to minimize.
[2022-05-19 11:58:40] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2022-05-19 11:58:40] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 0 ms to minimize.
[2022-05-19 11:58:40] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2022-05-19 11:58:40] [INFO ] Deduced a trap composed of 165 places in 175 ms of which 0 ms to minimize.
[2022-05-19 11:58:41] [INFO ] Deduced a trap composed of 183 places in 179 ms of which 0 ms to minimize.
[2022-05-19 11:58:41] [INFO ] Deduced a trap composed of 183 places in 170 ms of which 1 ms to minimize.
[2022-05-19 11:58:41] [INFO ] Deduced a trap composed of 174 places in 176 ms of which 1 ms to minimize.
[2022-05-19 11:58:41] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2022-05-19 11:58:42] [INFO ] Deduced a trap composed of 174 places in 162 ms of which 1 ms to minimize.
[2022-05-19 11:58:42] [INFO ] Deduced a trap composed of 165 places in 160 ms of which 0 ms to minimize.
[2022-05-19 11:58:42] [INFO ] Deduced a trap composed of 177 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:58:42] [INFO ] Deduced a trap composed of 158 places in 158 ms of which 0 ms to minimize.
[2022-05-19 11:58:43] [INFO ] Deduced a trap composed of 178 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:58:43] [INFO ] Deduced a trap composed of 195 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:58:43] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:58:43] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 0 ms to minimize.
[2022-05-19 11:58:43] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 1 ms to minimize.
[2022-05-19 11:58:44] [INFO ] Deduced a trap composed of 168 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:58:44] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 1 ms to minimize.
[2022-05-19 11:58:44] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2022-05-19 11:58:45] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 1 ms to minimize.
[2022-05-19 11:58:45] [INFO ] Deduced a trap composed of 159 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:58:45] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:58:45] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 1 ms to minimize.
[2022-05-19 11:58:45] [INFO ] Deduced a trap composed of 159 places in 166 ms of which 1 ms to minimize.
[2022-05-19 11:58:46] [INFO ] Deduced a trap composed of 180 places in 161 ms of which 2 ms to minimize.
[2022-05-19 11:58:46] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:58:46] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 0 ms to minimize.
[2022-05-19 11:58:47] [INFO ] Deduced a trap composed of 178 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:58:47] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2022-05-19 11:58:47] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:58:47] [INFO ] Deduced a trap composed of 165 places in 163 ms of which 0 ms to minimize.
[2022-05-19 11:58:48] [INFO ] Deduced a trap composed of 187 places in 154 ms of which 1 ms to minimize.
[2022-05-19 11:58:48] [INFO ] Deduced a trap composed of 190 places in 165 ms of which 0 ms to minimize.
[2022-05-19 11:58:48] [INFO ] Deduced a trap composed of 165 places in 177 ms of which 1 ms to minimize.
[2022-05-19 11:58:49] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 1 ms to minimize.
[2022-05-19 11:58:49] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 1 ms to minimize.
[2022-05-19 11:58:49] [INFO ] Deduced a trap composed of 177 places in 193 ms of which 0 ms to minimize.
[2022-05-19 11:58:49] [INFO ] Deduced a trap composed of 175 places in 160 ms of which 0 ms to minimize.
[2022-05-19 11:58:50] [INFO ] Deduced a trap composed of 174 places in 175 ms of which 0 ms to minimize.
[2022-05-19 11:58:51] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2022-05-19 11:58:51] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 0 ms to minimize.
[2022-05-19 11:58:52] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 0 ms to minimize.
[2022-05-19 11:58:52] [INFO ] Deduced a trap composed of 175 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:58:53] [INFO ] Deduced a trap composed of 166 places in 164 ms of which 0 ms to minimize.
[2022-05-19 11:58:53] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 0 ms to minimize.
[2022-05-19 11:58:54] [INFO ] Deduced a trap composed of 172 places in 167 ms of which 0 ms to minimize.
[2022-05-19 11:58:55] [INFO ] Deduced a trap composed of 178 places in 159 ms of which 1 ms to minimize.
[2022-05-19 11:58:55] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2022-05-19 11:58:55] [INFO ] Deduced a trap composed of 180 places in 182 ms of which 0 ms to minimize.
[2022-05-19 11:58:56] [INFO ] Deduced a trap composed of 175 places in 179 ms of which 1 ms to minimize.
[2022-05-19 11:58:56] [INFO ] Deduced a trap composed of 175 places in 171 ms of which 0 ms to minimize.
[2022-05-19 11:58:56] [INFO ] Deduced a trap composed of 166 places in 168 ms of which 1 ms to minimize.
[2022-05-19 11:58:57] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:58:57] [INFO ] Deduced a trap composed of 174 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:03] [INFO ] Trap strengthening (SAT) tested/added 56/56 trap constraints in 23808 ms
[2022-05-19 11:59:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 11:59:03] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 531/531 places, 747/747 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 531 transition count 746
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 530 transition count 746
Applied a total of 2 rules in 80 ms. Remains 530 /531 variables (removed 1) and now considering 746/747 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/531 places, 746/747 transitions.
Incomplete random walk after 10000 steps, including 527 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 265600 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 265600 steps, saw 79304 distinct states, run finished after 3003 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-19 11:59:06] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 11:59:06] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 11:59:06] [INFO ] [Real]Absence check using 76 positive place invariants in 35 ms returned sat
[2022-05-19 11:59:06] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2022-05-19 11:59:06] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:59:06] [INFO ] [Nat]Absence check using 76 positive place invariants in 26 ms returned sat
[2022-05-19 11:59:06] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2022-05-19 11:59:07] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:59:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:59:07] [INFO ] After 550ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 11:59:08] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:59:08] [INFO ] Deduced a trap composed of 181 places in 156 ms of which 0 ms to minimize.
[2022-05-19 11:59:08] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:59:08] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 1 ms to minimize.
[2022-05-19 11:59:08] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:09] [INFO ] Deduced a trap composed of 199 places in 160 ms of which 0 ms to minimize.
[2022-05-19 11:59:09] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2022-05-19 11:59:09] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2022-05-19 11:59:09] [INFO ] Deduced a trap composed of 182 places in 156 ms of which 0 ms to minimize.
[2022-05-19 11:59:09] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 0 ms to minimize.
[2022-05-19 11:59:10] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:59:10] [INFO ] Deduced a trap composed of 171 places in 154 ms of which 0 ms to minimize.
[2022-05-19 11:59:10] [INFO ] Deduced a trap composed of 173 places in 154 ms of which 0 ms to minimize.
[2022-05-19 11:59:11] [INFO ] Deduced a trap composed of 177 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:59:11] [INFO ] Deduced a trap composed of 165 places in 167 ms of which 1 ms to minimize.
[2022-05-19 11:59:11] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 1 ms to minimize.
[2022-05-19 11:59:11] [INFO ] Deduced a trap composed of 171 places in 171 ms of which 0 ms to minimize.
[2022-05-19 11:59:11] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 1 ms to minimize.
[2022-05-19 11:59:12] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2022-05-19 11:59:12] [INFO ] Deduced a trap composed of 173 places in 169 ms of which 0 ms to minimize.
[2022-05-19 11:59:12] [INFO ] Deduced a trap composed of 161 places in 172 ms of which 1 ms to minimize.
[2022-05-19 11:59:13] [INFO ] Deduced a trap composed of 170 places in 162 ms of which 1 ms to minimize.
[2022-05-19 11:59:13] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 1 ms to minimize.
[2022-05-19 11:59:14] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:59:14] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 0 ms to minimize.
[2022-05-19 11:59:14] [INFO ] Deduced a trap composed of 168 places in 161 ms of which 0 ms to minimize.
[2022-05-19 11:59:14] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 0 ms to minimize.
[2022-05-19 11:59:14] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2022-05-19 11:59:15] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:15] [INFO ] Deduced a trap composed of 168 places in 178 ms of which 1 ms to minimize.
[2022-05-19 11:59:15] [INFO ] Deduced a trap composed of 149 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:17] [INFO ] Deduced a trap composed of 180 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:59:17] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 0 ms to minimize.
[2022-05-19 11:59:18] [INFO ] Deduced a trap composed of 167 places in 150 ms of which 1 ms to minimize.
[2022-05-19 11:59:19] [INFO ] Deduced a trap composed of 155 places in 149 ms of which 0 ms to minimize.
[2022-05-19 11:59:20] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 0 ms to minimize.
[2022-05-19 11:59:21] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 1 ms to minimize.
[2022-05-19 11:59:30] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 22248 ms
[2022-05-19 11:59:30] [INFO ] After 23042ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:59:30] [INFO ] After 23578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 82 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 80 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2022-05-19 11:59:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 11:59:30] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 11:59:31] [INFO ] Implicit Places using invariants in 729 ms returned []
[2022-05-19 11:59:31] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 11:59:31] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 11:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 11:59:39] [INFO ] Implicit Places using invariants and state equation in 8340 ms returned []
Implicit Place search using SMT with State Equation took 9071 ms to find 0 implicit places.
[2022-05-19 11:59:39] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-19 11:59:39] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 11:59:39] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 11:59:40] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 88 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2022-05-19 11:59:40] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 11:59:40] [INFO ] [Real]Absence check using 76 positive place invariants in 11 ms returned sat
[2022-05-19 11:59:40] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2022-05-19 11:59:40] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 11:59:40] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2022-05-19 11:59:40] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2022-05-19 11:59:41] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 11:59:41] [INFO ] Deduced a trap composed of 190 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:59:41] [INFO ] Deduced a trap composed of 165 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:59:41] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 1 ms to minimize.
[2022-05-19 11:59:42] [INFO ] Deduced a trap composed of 159 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:42] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 1 ms to minimize.
[2022-05-19 11:59:42] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2022-05-19 11:59:42] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 1 ms to minimize.
[2022-05-19 11:59:43] [INFO ] Deduced a trap composed of 160 places in 164 ms of which 0 ms to minimize.
[2022-05-19 11:59:43] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:59:43] [INFO ] Deduced a trap composed of 175 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:59:43] [INFO ] Deduced a trap composed of 174 places in 170 ms of which 1 ms to minimize.
[2022-05-19 11:59:44] [INFO ] Deduced a trap composed of 174 places in 165 ms of which 1 ms to minimize.
[2022-05-19 11:59:44] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 1 ms to minimize.
[2022-05-19 11:59:45] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:59:45] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 1 ms to minimize.
[2022-05-19 11:59:45] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 1 ms to minimize.
[2022-05-19 11:59:45] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 0 ms to minimize.
[2022-05-19 11:59:46] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:59:46] [INFO ] Deduced a trap composed of 168 places in 163 ms of which 1 ms to minimize.
[2022-05-19 11:59:46] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:59:55] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 14316 ms
[2022-05-19 11:59:55] [INFO ] After 15136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:59:55] [INFO ] After 15265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2022-05-19 11:59:55] [INFO ] Flatten gal took : 74 ms
[2022-05-19 11:59:55] [INFO ] Flatten gal took : 45 ms
[2022-05-19 11:59:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14844828438251856962.gal : 26 ms
[2022-05-19 11:59:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality262519468622965544.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2586688461363289003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14844828438251856962.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality262519468622965544.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality262519468622965544.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :32 after 292
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :292 after 5021
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5021 after 18464
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18464 after 82687
Detected timeout of ITS tools.
[2022-05-19 12:00:10] [INFO ] Flatten gal took : 38 ms
[2022-05-19 12:00:10] [INFO ] Applying decomposition
[2022-05-19 12:00:11] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15918909907475258708.txt' '-o' '/tmp/graph15918909907475258708.bin' '-w' '/tmp/graph15918909907475258708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15918909907475258708.bin' '-l' '-1' '-v' '-w' '/tmp/graph15918909907475258708.weights' '-q' '0' '-e' '0.001'
[2022-05-19 12:00:11] [INFO ] Decomposing Gal with order
[2022-05-19 12:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 12:00:11] [INFO ] Removed a total of 936 redundant transitions.
[2022-05-19 12:00:11] [INFO ] Flatten gal took : 169 ms
[2022-05-19 12:00:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 49 ms.
[2022-05-19 12:00:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5462020011513810503.gal : 19 ms
[2022-05-19 12:00:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5568551139932003748.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2586688461363289003;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5462020011513810503.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5568551139932003748.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5568551139932003748.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9808298932811648969
[2022-05-19 12:00:26] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9808298932811648969
Running compilation step : cd /tmp/ltsmin9808298932811648969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1370 ms.
Running link step : cd /tmp/ltsmin9808298932811648969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9808298932811648969;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp0==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBNT-PT-S05J40-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(p1))))))'
Support contains 42 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 19 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:00:42] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:42] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 12:00:43] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
[2022-05-19 12:00:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:43] [INFO ] Computed 97 place invariants in 22 ms
[2022-05-19 12:00:43] [INFO ] Implicit Places using invariants in 816 ms returned []
[2022-05-19 12:00:43] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:43] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:00:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:00:54] [INFO ] Implicit Places using invariants and state equation in 10482 ms returned []
Implicit Place search using SMT with State Equation took 11300 ms to find 0 implicit places.
[2022-05-19 12:00:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:54] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-19 12:00:55] [INFO ] Dead Transitions using invariants and state equation in 1003 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (LT s320 1) (LT s578 1) (LT s259 1) (LT s317 1) (LT s252 1) (LT s67 1) (LT s70 1) (LT s72 1) (LT s71 1) (LT s203 1) (LT s530 1) (LT s208 1) (LT s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 583 ms.
Product exploration explored 100000 steps with 33333 reset in 506 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 14841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U !(F(p0)||!p1))))))'
Support contains 253 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 15 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:00:56] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:56] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:00:58] [INFO ] Dead Transitions using invariants and state equation in 1081 ms found 0 transitions.
[2022-05-19 12:00:58] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:58] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 12:00:58] [INFO ] Implicit Places using invariants in 609 ms returned []
[2022-05-19 12:00:58] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:00:58] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 12:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:01:05] [INFO ] Implicit Places using invariants and state equation in 7289 ms returned []
Implicit Place search using SMT with State Equation took 7904 ms to find 0 implicit places.
[2022-05-19 12:01:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:05] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 12:01:06] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 213 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(OR (AND (GEQ s121 8) (GEQ s289 1) (GEQ s297 1) (GEQ s468 1)) (AND (GEQ s121 8) (GEQ s297 1) (GEQ s468 2)) (AND (GEQ s121 8) (GEQ s289 2) (GEQ s297 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-01 finished in 10205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 31 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:01:07] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:07] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 12:01:08] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
[2022-05-19 12:01:08] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:08] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:01:08] [INFO ] Implicit Places using invariants in 824 ms returned []
[2022-05-19 12:01:08] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:08] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 12:01:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:01:19] [INFO ] Implicit Places using invariants and state equation in 10055 ms returned []
Implicit Place search using SMT with State Equation took 10881 ms to find 0 implicit places.
[2022-05-19 12:01:19] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:19] [INFO ] Computed 97 place invariants in 16 ms
[2022-05-19 12:01:20] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s215 1) (GEQ s417 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-02 finished in 12954 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 578 transition count 749
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 530 transition count 746
Applied a total of 188 rules in 82 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2022-05-19 12:01:20] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 12:01:20] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 12:01:20] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
[2022-05-19 12:01:20] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 12:01:20] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 12:01:21] [INFO ] Implicit Places using invariants in 721 ms returned []
[2022-05-19 12:01:21] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 12:01:21] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:01:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:01:28] [INFO ] Implicit Places using invariants and state equation in 7171 ms returned []
Implicit Place search using SMT with State Equation took 7893 ms to find 0 implicit places.
[2022-05-19 12:01:28] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 12:01:28] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2022-05-19 12:01:28] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 12:01:29] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/624 places, 746/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 530/624 places, 746/840 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s167 2)], 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 34 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-03 finished in 9291 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(!(p0 U (F(X(!p0)) U !p1))))))'
Support contains 41 out of 624 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 835
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 619 transition count 835
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 619 transition count 831
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 615 transition count 831
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 614 transition count 830
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 614 transition count 830
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 612 transition count 828
Applied a total of 24 rules in 72 ms. Remains 612 /624 variables (removed 12) and now considering 828/840 (removed 12) transitions.
[2022-05-19 12:01:29] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 12:01:29] [INFO ] Computed 97 place invariants in 21 ms
[2022-05-19 12:01:30] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
[2022-05-19 12:01:30] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 12:01:30] [INFO ] Computed 97 place invariants in 12 ms
[2022-05-19 12:01:31] [INFO ] Implicit Places using invariants in 711 ms returned []
[2022-05-19 12:01:31] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 12:01:31] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 12:01:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:01:42] [INFO ] Implicit Places using invariants and state equation in 11675 ms returned []
Implicit Place search using SMT with State Equation took 12388 ms to find 0 implicit places.
[2022-05-19 12:01:42] [INFO ] Redundant transitions in 10 ms returned []
[2022-05-19 12:01:42] [INFO ] Flow matrix only has 824 transitions (discarded 4 similar events)
// Phase 1: matrix 824 rows 612 cols
[2022-05-19 12:01:42] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 12:01:43] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 612/624 places, 828/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 612/624 places, 828/840 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s188 1) (GEQ s505 1) (GEQ s253 1) (GEQ s437 1) (GEQ s507 1) (GEQ s311 1) (GEQ s249 1) (GEQ s261 1) (GEQ s12 1) (GEQ s442 1) (GEQ s258 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-04 finished in 14370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U X(p0)))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Applied a total of 0 rules in 16 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2022-05-19 12:01:43] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:01:43] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:01:44] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
[2022-05-19 12:01:44] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:01:44] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:01:45] [INFO ] Implicit Places using invariants in 804 ms returned []
[2022-05-19 12:01:45] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:01:45] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:01:52] [INFO ] Implicit Places using invariants and state equation in 7010 ms returned []
Implicit Place search using SMT with State Equation took 7815 ms to find 0 implicit places.
[2022-05-19 12:01:52] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:01:52] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:01:53] [INFO ] Dead Transitions using invariants and state equation in 1017 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 840/840 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s217 1) (LT s200 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 494 ms.
Product exploration explored 100000 steps with 50000 reset in 531 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-05 finished in 11074 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(G(p0)||!(X(G(p1)) U p2)))))'
Support contains 93 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 30 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:01:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:54] [INFO ] Computed 97 place invariants in 13 ms
[2022-05-19 12:01:55] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
[2022-05-19 12:01:55] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:55] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:01:56] [INFO ] Implicit Places using invariants in 729 ms returned []
[2022-05-19 12:01:56] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:01:56] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:01:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:02:08] [INFO ] Implicit Places using invariants and state equation in 11764 ms returned []
Implicit Place search using SMT with State Equation took 12497 ms to find 0 implicit places.
[2022-05-19 12:02:08] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:08] [INFO ] Computed 97 place invariants in 18 ms
[2022-05-19 12:02:09] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p2 p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p0 (NOT p2)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p0 p2 p1), acceptance={1} source=3 dest: 8}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(OR (AND p0 p1) (AND (NOT p2) p1)), acceptance={0, 1} source=5 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=8 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p2 p1), acceptance={1} source=8 dest: 8}]], initial=0, aps=[p0:(AND (OR (LT s55 1) (LT s419 1) (LT s493 1)) (OR (LT s55 1) (LT s140 1) (LT s493 1)) (OR (LT s55 1) (LT s493 1) (LT s579 1)) (OR (LT s55 1) (LT s443 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1290 ms.
Product exploration explored 100000 steps with 50000 reset in 1321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2))), (X (OR p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (OR (AND p0 p1) (AND (NOT p2) p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p2) (NOT p1))
Knowledge based reduction with 20 factoid took 841 ms. Reduced automaton from 9 states, 40 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-07 finished in 18334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G((F(p1)||p0))))))'
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 624 transition count 795
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 90 place count 579 transition count 752
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 84 ms. Remains 533 /624 variables (removed 91) and now considering 749/840 (removed 91) transitions.
[2022-05-19 12:02:13] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:13] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 12:02:14] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
[2022-05-19 12:02:14] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:14] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:02:14] [INFO ] Implicit Places using invariants in 664 ms returned []
[2022-05-19 12:02:14] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:14] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:02:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:02:22] [INFO ] Implicit Places using invariants and state equation in 7482 ms returned []
Implicit Place search using SMT with State Equation took 8150 ms to find 0 implicit places.
[2022-05-19 12:02:22] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-19 12:02:22] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:22] [INFO ] Computed 97 place invariants in 15 ms
[2022-05-19 12:02:22] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/624 places, 749/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/624 places, 749/840 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s38 1) (GEQ s467 1)) (AND (GEQ s102 9) (GEQ s253 1) (GEQ s411 1))), p1:(AND (LT s162 3) (GEQ s102 9) (GEQ s253 1) (GEQ s411 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 25 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-08 finished in 9897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 88 place count 580 transition count 750
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 180 place count 534 transition count 750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 62 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2022-05-19 12:02:23] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2022-05-19 12:02:23] [INFO ] Computed 97 place invariants in 11 ms
[2022-05-19 12:02:23] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
[2022-05-19 12:02:23] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2022-05-19 12:02:23] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:02:24] [INFO ] Implicit Places using invariants in 693 ms returned []
[2022-05-19 12:02:24] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2022-05-19 12:02:24] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 12:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:02:29] [INFO ] Implicit Places using invariants and state equation in 5129 ms returned []
Implicit Place search using SMT with State Equation took 5828 ms to find 0 implicit places.
[2022-05-19 12:02:29] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-19 12:02:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2022-05-19 12:02:29] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:02:30] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s184 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 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-09 finished in 7219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U !p1))&&!p1)))'
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 42 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:02:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:30] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:02:31] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
[2022-05-19 12:02:31] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:31] [INFO ] Computed 97 place invariants in 19 ms
[2022-05-19 12:02:32] [INFO ] Implicit Places using invariants in 799 ms returned []
[2022-05-19 12:02:32] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:32] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:02:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:02:42] [INFO ] Implicit Places using invariants and state equation in 10194 ms returned []
Implicit Place search using SMT with State Equation took 10994 ms to find 0 implicit places.
[2022-05-19 12:02:42] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:42] [INFO ] Computed 97 place invariants in 10 ms
[2022-05-19 12:02:43] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 157 ms :[p1, p1, true, p1, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s200 2), p0:(AND (GEQ s46 1) (GEQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 401 ms.
Product exploration explored 100000 steps with 33333 reset in 414 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0))
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 5 states, 9 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-11 finished in 14105 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(F((F(p1)&&p0)))&&G(p1)))))'
Support contains 8 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 88 place count 580 transition count 752
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 536 transition count 752
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 535 transition count 751
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 535 transition count 751
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 75 ms. Remains 533 /624 variables (removed 91) and now considering 749/840 (removed 91) transitions.
[2022-05-19 12:02:44] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:44] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:02:45] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
[2022-05-19 12:02:45] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:45] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 12:02:45] [INFO ] Implicit Places using invariants in 699 ms returned []
[2022-05-19 12:02:45] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:45] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:02:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:02:52] [INFO ] Implicit Places using invariants and state equation in 6678 ms returned []
Implicit Place search using SMT with State Equation took 7378 ms to find 0 implicit places.
[2022-05-19 12:02:52] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-19 12:02:52] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2022-05-19 12:02:52] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:02:53] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/624 places, 749/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 533/624 places, 749/840 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s101 6) (GEQ s252 1) (GEQ s400 1) (GEQ s411 1) (GEQ s478 1) (GEQ s521 1)), p0:(AND (GEQ s12 1) (GEQ s264 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 28 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-13 finished in 8890 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0))) U p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 33 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2022-05-19 12:02:53] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:53] [INFO ] Computed 97 place invariants in 14 ms
[2022-05-19 12:02:54] [INFO ] Dead Transitions using invariants and state equation in 940 ms found 0 transitions.
[2022-05-19 12:02:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:54] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:02:55] [INFO ] Implicit Places using invariants in 827 ms returned []
[2022-05-19 12:02:55] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:02:55] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:03:05] [INFO ] Implicit Places using invariants and state equation in 10642 ms returned []
Implicit Place search using SMT with State Equation took 11471 ms to find 0 implicit places.
[2022-05-19 12:03:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2022-05-19 12:03:05] [INFO ] Computed 97 place invariants in 17 ms
[2022-05-19 12:03:06] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-14 finished in 13557 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G(p0)))) U p1))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Applied a total of 0 rules in 12 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2022-05-19 12:03:06] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:03:06] [INFO ] Computed 97 place invariants in 23 ms
[2022-05-19 12:03:07] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
[2022-05-19 12:03:07] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:03:07] [INFO ] Computed 97 place invariants in 9 ms
[2022-05-19 12:03:08] [INFO ] Implicit Places using invariants in 810 ms returned []
[2022-05-19 12:03:08] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:03:08] [INFO ] Computed 97 place invariants in 8 ms
[2022-05-19 12:03:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 12:03:16] [INFO ] Implicit Places using invariants and state equation in 7654 ms returned []
Implicit Place search using SMT with State Equation took 8465 ms to find 0 implicit places.
[2022-05-19 12:03:16] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2022-05-19 12:03:16] [INFO ] Computed 97 place invariants in 20 ms
[2022-05-19 12:03:17] [INFO ] Dead Transitions using invariants and state equation in 980 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 840/840 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s44 1), p0:(LT s510 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 888 steps with 57 reset in 3 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-15 finished in 10607 ms.
All properties solved by simple procedures.
Total runtime 312843 ms.

BK_STOP 1652961797500

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
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 PolyORBNT-PT-S05J40, 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 r168-tall-165277017200828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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