About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1811.611 | 289735.00 | 443840.00 | 5939.60 | FFFFFTFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016900612.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 PolyORBLF-PT-S02J06T06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016900612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 12K Apr 29 13:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 29 13:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 29 13:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 601K 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 PolyORBLF-PT-S02J06T06-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652894433290
Running Version 202205111006
[2022-05-18 17:20:35] [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-18 17:20:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 17:20:35] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2022-05-18 17:20:35] [INFO ] Transformed 536 places.
[2022-05-18 17:20:35] [INFO ] Transformed 1064 transitions.
[2022-05-18 17:20:35] [INFO ] Parsed PT model containing 536 places and 1064 transitions in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Support contains 226 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 968/968 transitions.
Applied a total of 0 rules in 43 ms. Remains 536 /536 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-18 17:20:35] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2022-05-18 17:20:35] [INFO ] Computed 50 place invariants in 51 ms
[2022-05-18 17:20:36] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
[2022-05-18 17:20:36] [INFO ] Flow matrix only has 890 transitions (discarded 12 similar events)
// Phase 1: matrix 890 rows 536 cols
[2022-05-18 17:20:36] [INFO ] Computed 50 place invariants in 32 ms
[2022-05-18 17:20:37] [INFO ] Implicit Places using invariants in 326 ms returned [96, 111, 241, 254, 307, 497]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 337 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/536 places, 902/968 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 528 transition count 890
Reduce places removed 6 places and 12 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 8 place count 522 transition count 878
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 8 rules in 15 ms. Remains 522 /530 variables (removed 8) and now considering 878/902 (removed 24) transitions.
[2022-05-18 17:20:37] [INFO ] Flow matrix only has 866 transitions (discarded 12 similar events)
// Phase 1: matrix 866 rows 522 cols
[2022-05-18 17:20:37] [INFO ] Computed 50 place invariants in 12 ms
[2022-05-18 17:20:37] [INFO ] Implicit Places using invariants in 262 ms returned []
[2022-05-18 17:20:37] [INFO ] Flow matrix only has 866 transitions (discarded 12 similar events)
// Phase 1: matrix 866 rows 522 cols
[2022-05-18 17:20:37] [INFO ] Computed 50 place invariants in 13 ms
[2022-05-18 17:20:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:20:43] [INFO ] Implicit Places using invariants and state equation in 5712 ms returned []
Implicit Place search using SMT with State Equation took 5980 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 522/536 places, 878/968 transitions.
Finished structural reductions, in 2 iterations. Remains : 522/536 places, 878/968 transitions.
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Support contains 220 out of 516 places after structural reductions.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-18 17:20:43] [INFO ] Flatten gal took : 97 ms
[2022-05-18 17:20:43] [INFO ] Flatten gal took : 67 ms
[2022-05-18 17:20:43] [INFO ] Input system was already deterministic with 878 transitions.
Support contains 160 out of 516 places (down from 220) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 31) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 17:20:44] [INFO ] Flow matrix only has 866 transitions (discarded 12 similar events)
// Phase 1: matrix 866 rows 516 cols
[2022-05-18 17:20:44] [INFO ] Computed 44 place invariants in 15 ms
[2022-05-18 17:20:45] [INFO ] [Real]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-18 17:20:45] [INFO ] [Real]Absence check using 17 positive and 27 generalized place invariants in 26 ms returned sat
[2022-05-18 17:20:46] [INFO ] After 1862ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-18 17:20:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2022-05-18 17:20:46] [INFO ] [Nat]Absence check using 17 positive and 27 generalized place invariants in 23 ms returned sat
[2022-05-18 17:20:48] [INFO ] After 2159ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-18 17:20:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:20:49] [INFO ] After 607ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-18 17:20:49] [INFO ] Deduced a trap composed of 72 places in 265 ms of which 3 ms to minimize.
[2022-05-18 17:20:49] [INFO ] Deduced a trap composed of 73 places in 205 ms of which 2 ms to minimize.
[2022-05-18 17:20:50] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2022-05-18 17:20:50] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2022-05-18 17:20:50] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 1 ms to minimize.
[2022-05-18 17:20:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1248 ms
[2022-05-18 17:20:50] [INFO ] After 2138ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 257 ms.
[2022-05-18 17:20:50] [INFO ] After 4690ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 514 transition count 824
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 110 place count 460 transition count 764
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 230 place count 400 transition count 764
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 233 place count 397 transition count 761
Iterating global reduction 2 with 3 rules applied. Total rules applied 236 place count 397 transition count 761
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 2 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 328 place count 351 transition count 715
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 340 place count 351 transition count 703
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 352 place count 339 transition count 703
Applied a total of 352 rules in 141 ms. Remains 339 /516 variables (removed 177) and now considering 703/878 (removed 175) transitions.
[2022-05-18 17:20:51] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:20:51] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:20:51] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 339/516 places, 703/878 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 17:20:51] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:20:51] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 17:20:51] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 17:20:51] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 16 ms returned sat
[2022-05-18 17:20:51] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 17:20:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-18 17:20:51] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 18 ms returned sat
[2022-05-18 17:20:53] [INFO ] After 1303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 17:20:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:20:53] [INFO ] After 575ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 17:20:53] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2022-05-18 17:20:53] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 1 ms to minimize.
[2022-05-18 17:20:54] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 0 ms to minimize.
[2022-05-18 17:20:54] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 0 ms to minimize.
[2022-05-18 17:20:54] [INFO ] Deduced a trap composed of 139 places in 129 ms of which 1 ms to minimize.
[2022-05-18 17:20:54] [INFO ] Deduced a trap composed of 166 places in 143 ms of which 1 ms to minimize.
[2022-05-18 17:20:54] [INFO ] Deduced a trap composed of 155 places in 127 ms of which 1 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 1 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 1 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 1 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 1 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 4 ms to minimize.
[2022-05-18 17:20:55] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2022-05-18 17:20:56] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 0 ms to minimize.
[2022-05-18 17:20:56] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 0 ms to minimize.
[2022-05-18 17:20:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2752 ms
[2022-05-18 17:20:56] [INFO ] After 3369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2022-05-18 17:20:56] [INFO ] After 4809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 339 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 31 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 339/339 places, 703/703 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 257180 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 257180 steps, saw 145159 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 17:20:59] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:20:59] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 17:20:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 17:20:59] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 17 ms returned sat
[2022-05-18 17:20:59] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 17:20:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-18 17:20:59] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 27 ms returned sat
[2022-05-18 17:21:01] [INFO ] After 1289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 17:21:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:21:01] [INFO ] After 582ms SMT Verify possible using 72 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 17:21:01] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 1 ms to minimize.
[2022-05-18 17:21:01] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 0 ms to minimize.
[2022-05-18 17:21:02] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2022-05-18 17:21:02] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 1 ms to minimize.
[2022-05-18 17:21:02] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 0 ms to minimize.
[2022-05-18 17:21:02] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 3 ms to minimize.
[2022-05-18 17:21:02] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 0 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 0 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 1 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 0 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 116 places in 122 ms of which 1 ms to minimize.
[2022-05-18 17:21:03] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2022-05-18 17:21:04] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 0 ms to minimize.
[2022-05-18 17:21:04] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 0 ms to minimize.
[2022-05-18 17:21:04] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2731 ms
[2022-05-18 17:21:04] [INFO ] After 3359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-18 17:21:04] [INFO ] After 4785ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 339 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 19 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 339/339 places, 703/703 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 17 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2022-05-18 17:21:04] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:21:04] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 17:21:04] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-18 17:21:04] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:21:04] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 17:21:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:21:14] [INFO ] Implicit Places using invariants and state equation in 9194 ms returned []
Implicit Place search using SMT with State Equation took 9510 ms to find 0 implicit places.
[2022-05-18 17:21:14] [INFO ] Redundant transitions in 44 ms returned []
[2022-05-18 17:21:14] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2022-05-18 17:21:14] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:21:14] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 339/339 places, 703/703 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 339 transition count 691
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 334 transition count 711
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 44 place count 334 transition count 689
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 334 transition count 683
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 328 transition count 683
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 65 place count 328 transition count 674
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 74 place count 319 transition count 674
Applied a total of 74 rules in 78 ms. Remains 319 /339 variables (removed 20) and now considering 674/703 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 674 rows 319 cols
[2022-05-18 17:21:14] [INFO ] Computed 42 place invariants in 5 ms
[2022-05-18 17:21:14] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-18 17:21:14] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2022-05-18 17:21:14] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 17:21:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-18 17:21:14] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 17:21:15] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 17:21:15] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2022-05-18 17:21:15] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-05-18 17:21:15] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 0 ms to minimize.
[2022-05-18 17:21:16] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2022-05-18 17:21:16] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 0 ms to minimize.
[2022-05-18 17:21:16] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2022-05-18 17:21:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 925 ms
[2022-05-18 17:21:16] [INFO ] After 1591ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-18 17:21:16] [INFO ] After 1689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-18 17:21:16] [INFO ] Flatten gal took : 48 ms
[2022-05-18 17:21:16] [INFO ] Flatten gal took : 39 ms
[2022-05-18 17:21:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9233446107689453963.gal : 17 ms
[2022-05-18 17:21:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16464417352441756566.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2012261538972635360;'/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/ReachabilityCardinality9233446107689453963.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16464417352441756566.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...320
Loading property file /tmp/ReachabilityCardinality16464417352441756566.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 62
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :62 after 69
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :69 after 128
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :128 after 564
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :564 after 854
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :854 after 1358
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1358 after 3060
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3060 after 5386
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :12044 after 16569
Detected timeout of ITS tools.
[2022-05-18 17:21:31] [INFO ] Flatten gal took : 37 ms
[2022-05-18 17:21:31] [INFO ] Applying decomposition
[2022-05-18 17:21:32] [INFO ] Flatten gal took : 32 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/graph14162423241651664474.txt' '-o' '/tmp/graph14162423241651664474.bin' '-w' '/tmp/graph14162423241651664474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14162423241651664474.bin' '-l' '-1' '-v' '-w' '/tmp/graph14162423241651664474.weights' '-q' '0' '-e' '0.001'
[2022-05-18 17:21:32] [INFO ] Decomposing Gal with order
[2022-05-18 17:21:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 17:21:32] [INFO ] Removed a total of 628 redundant transitions.
[2022-05-18 17:21:32] [INFO ] Flatten gal took : 182 ms
[2022-05-18 17:21:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 419 labels/synchronizations in 24 ms.
[2022-05-18 17:21:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3962296396166866018.gal : 8 ms
[2022-05-18 17:21:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10514916505238094833.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2012261538972635360;'/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/ReachabilityCardinality3962296396166866018.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10514916505238094833.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...299
Loading property file /tmp/ReachabilityCardinality10514916505238094833.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 788
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :788 after 4484
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :4484 after 4485
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :4485 after 4489
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4489 after 13200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :13200 after 15880
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15880 after 16040
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :16040 after 32281
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17912756293837840999
[2022-05-18 17:21:47] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17912756293837840999
Running compilation step : cd /tmp/ltsmin17912756293837840999;'/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 1059 ms.
Running link step : cd /tmp/ltsmin17912756293837840999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17912756293837840999;'/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' 'AtomicPropp14==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-00 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(G(p0)))'
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 878
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 508 transition count 872
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 508 transition count 872
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 502 transition count 866
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 502 transition count 866
Applied a total of 26 rules in 30 ms. Remains 502 /516 variables (removed 14) and now considering 866/878 (removed 12) transitions.
[2022-05-18 17:22:02] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:02] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 17:22:03] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
[2022-05-18 17:22:03] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:03] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:22:04] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-05-18 17:22:04] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:04] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 17:22:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:12] [INFO ] Implicit Places using invariants and state equation in 8398 ms returned []
Implicit Place search using SMT with State Equation took 8835 ms to find 0 implicit places.
[2022-05-18 17:22:12] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:12] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 17:22:13] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 866/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/516 places, 866/878 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s32 1) (LT s241 1) (LT s410 1) (LT s422 1) (LT s354 1) (LT s251 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 6 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-01 finished in 10810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(X(G(p1))) U F(p2))||p0)))'
Support contains 68 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 514 transition count 824
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 460 transition count 824
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 108 place count 460 transition count 818
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 120 place count 454 transition count 818
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 451 transition count 815
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 451 transition count 815
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 222 place count 403 transition count 767
Applied a total of 222 rules in 54 ms. Remains 403 /516 variables (removed 113) and now considering 767/878 (removed 111) transitions.
[2022-05-18 17:22:13] [INFO ] Flow matrix only has 755 transitions (discarded 12 similar events)
// Phase 1: matrix 755 rows 403 cols
[2022-05-18 17:22:13] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:22:14] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
[2022-05-18 17:22:14] [INFO ] Flow matrix only has 755 transitions (discarded 12 similar events)
// Phase 1: matrix 755 rows 403 cols
[2022-05-18 17:22:14] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 17:22:14] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-05-18 17:22:14] [INFO ] Flow matrix only has 755 transitions (discarded 12 similar events)
// Phase 1: matrix 755 rows 403 cols
[2022-05-18 17:22:14] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 17:22:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:23] [INFO ] Implicit Places using invariants and state equation in 8394 ms returned []
Implicit Place search using SMT with State Equation took 8714 ms to find 0 implicit places.
[2022-05-18 17:22:23] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-18 17:22:23] [INFO ] Flow matrix only has 755 transitions (discarded 12 similar events)
// Phase 1: matrix 755 rows 403 cols
[2022-05-18 17:22:23] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 17:22:23] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/516 places, 767/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 403/516 places, 767/878 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, p2, (AND p2 (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p2:(OR (AND (GEQ s287 1) (GEQ s366 1)) (AND (GEQ s215 1) (GEQ s263 1)) (AND (GEQ s230 1) (GEQ s376 1)) (AND (GEQ s262 1) (GEQ s355 1)) (AND (GEQ s237 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-02 finished in 10119 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 514 transition count 830
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 466 transition count 830
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 466 transition count 770
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 406 transition count 770
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 403 transition count 767
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 403 transition count 767
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 318 place count 355 transition count 719
Applied a total of 318 rules in 51 ms. Remains 355 /516 variables (removed 161) and now considering 719/878 (removed 159) transitions.
[2022-05-18 17:22:23] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
// Phase 1: matrix 707 rows 355 cols
[2022-05-18 17:22:23] [INFO ] Computed 42 place invariants in 6 ms
[2022-05-18 17:22:24] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
[2022-05-18 17:22:24] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
// Phase 1: matrix 707 rows 355 cols
[2022-05-18 17:22:24] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:22:24] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-05-18 17:22:24] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
// Phase 1: matrix 707 rows 355 cols
[2022-05-18 17:22:24] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:22:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:29] [INFO ] Implicit Places using invariants and state equation in 4878 ms returned []
Implicit Place search using SMT with State Equation took 5222 ms to find 0 implicit places.
[2022-05-18 17:22:29] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 17:22:29] [INFO ] Flow matrix only has 707 transitions (discarded 12 similar events)
// Phase 1: matrix 707 rows 355 cols
[2022-05-18 17:22:29] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:22:30] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 355/516 places, 719/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 355/516 places, 719/878 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s162 1) (LT s326 1) (LT s73 1) (LT s261 1) (LT s202 1) (LT s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 55 reset in 431 ms.
Stack based approach found an accepted trace after 820 steps with 0 reset with depth 821 and stack size 814 in 4 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-03 finished in 6721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 510 transition count 872
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 510 transition count 872
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 504 transition count 866
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 504 transition count 866
Applied a total of 24 rules in 24 ms. Remains 504 /516 variables (removed 12) and now considering 866/878 (removed 12) transitions.
[2022-05-18 17:22:30] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 504 cols
[2022-05-18 17:22:30] [INFO ] Computed 44 place invariants in 17 ms
[2022-05-18 17:22:31] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
[2022-05-18 17:22:31] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 504 cols
[2022-05-18 17:22:31] [INFO ] Computed 44 place invariants in 14 ms
[2022-05-18 17:22:31] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-05-18 17:22:31] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 504 cols
[2022-05-18 17:22:31] [INFO ] Computed 44 place invariants in 12 ms
[2022-05-18 17:22:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:38] [INFO ] Implicit Places using invariants and state equation in 6378 ms returned []
Implicit Place search using SMT with State Equation took 6813 ms to find 0 implicit places.
[2022-05-18 17:22:38] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 504 cols
[2022-05-18 17:22:38] [INFO ] Computed 44 place invariants in 8 ms
[2022-05-18 17:22:39] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 504/516 places, 866/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/516 places, 866/878 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s130 1) (GEQ s404 1) (GEQ s461 1)) (AND (GEQ s13 1) (GEQ s130 1) (GEQ s213 1) (GEQ s409 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 477 ms.
Product exploration explored 100000 steps with 50000 reset in 435 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), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-05 finished in 9631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((!p1 U ((!p1&&F(G(!p2)))||G(!p1)))))))'
Support contains 30 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 514 transition count 836
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 472 transition count 830
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 466 transition count 830
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 96 place count 466 transition count 782
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 192 place count 418 transition count 782
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 414 transition count 778
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 414 transition count 778
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 260 place count 384 transition count 748
Applied a total of 260 rules in 41 ms. Remains 384 /516 variables (removed 132) and now considering 748/878 (removed 130) transitions.
[2022-05-18 17:22:40] [INFO ] Flow matrix only has 736 transitions (discarded 12 similar events)
// Phase 1: matrix 736 rows 384 cols
[2022-05-18 17:22:40] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 17:22:40] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
[2022-05-18 17:22:40] [INFO ] Flow matrix only has 736 transitions (discarded 12 similar events)
// Phase 1: matrix 736 rows 384 cols
[2022-05-18 17:22:40] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:22:41] [INFO ] Implicit Places using invariants in 316 ms returned []
[2022-05-18 17:22:41] [INFO ] Flow matrix only has 736 transitions (discarded 12 similar events)
// Phase 1: matrix 736 rows 384 cols
[2022-05-18 17:22:41] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 17:22:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:46] [INFO ] Implicit Places using invariants and state equation in 5963 ms returned []
Implicit Place search using SMT with State Equation took 6280 ms to find 0 implicit places.
[2022-05-18 17:22:47] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-18 17:22:47] [INFO ] Flow matrix only has 736 transitions (discarded 12 similar events)
// Phase 1: matrix 736 rows 384 cols
[2022-05-18 17:22:47] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:22:47] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 384/516 places, 748/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 384/516 places, 748/878 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) p1), p1, p1, (AND p1 p2)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s275 1) (GEQ s373 1)) (AND (GEQ s70 1) (GEQ s275 1) (GEQ s282 1)) (AND (GEQ s70 1) (GEQ s121 1) (GEQ s275 1)) (AND (GEQ s70 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 36 reset in 508 ms.
Stack based approach found an accepted trace after 811 steps with 0 reset with depth 812 and stack size 812 in 4 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-06 finished in 8084 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 18 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 878
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 508 transition count 872
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 508 transition count 872
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 502 transition count 866
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 502 transition count 866
Applied a total of 26 rules in 21 ms. Remains 502 /516 variables (removed 14) and now considering 866/878 (removed 12) transitions.
[2022-05-18 17:22:48] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:48] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:22:49] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
[2022-05-18 17:22:49] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:49] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:22:49] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-05-18 17:22:49] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:49] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 17:22:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:22:58] [INFO ] Implicit Places using invariants and state equation in 8909 ms returned []
Implicit Place search using SMT with State Equation took 9320 ms to find 0 implicit places.
[2022-05-18 17:22:58] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:22:58] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:22:59] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 866/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/516 places, 866/878 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s261 1) (GEQ s291 1) (GEQ s457 1) (GEQ s18 1) (GEQ s183 1) (GEQ s411 1) (GEQ s380 1) (GEQ s238 1) (GEQ s301 1) (GEQ s91 1) (GEQ s77 1) (GEQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 57 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-07 finished in 11152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 514 transition count 824
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 460 transition count 764
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 400 transition count 764
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 397 transition count 761
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 397 transition count 761
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 330 place count 349 transition count 713
Applied a total of 330 rules in 57 ms. Remains 349 /516 variables (removed 167) and now considering 713/878 (removed 165) transitions.
[2022-05-18 17:22:59] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:22:59] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 17:22:59] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
[2022-05-18 17:22:59] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:22:59] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:23:00] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-18 17:23:00] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:00] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 17:23:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:05] [INFO ] Implicit Places using invariants and state equation in 5573 ms returned []
Implicit Place search using SMT with State Equation took 5897 ms to find 0 implicit places.
[2022-05-18 17:23:05] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-18 17:23:05] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:05] [INFO ] Computed 42 place invariants in 11 ms
[2022-05-18 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/516 places, 713/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 349/516 places, 713/878 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s113 1) (GEQ s265 1) (GEQ s266 10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4828 steps with 33 reset in 19 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-08 finished in 6987 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F((G(p1)||p2))&&p3)))'
Support contains 12 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 514 transition count 844
Reduce places removed 34 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 40 rules applied. Total rules applied 74 place count 480 transition count 838
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 80 place count 474 transition count 838
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 80 place count 474 transition count 771
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 214 place count 407 transition count 771
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 217 place count 404 transition count 768
Iterating global reduction 3 with 3 rules applied. Total rules applied 220 place count 404 transition count 768
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 272 place count 378 transition count 742
Applied a total of 272 rules in 46 ms. Remains 378 /516 variables (removed 138) and now considering 742/878 (removed 136) transitions.
[2022-05-18 17:23:06] [INFO ] Flow matrix only has 730 transitions (discarded 12 similar events)
// Phase 1: matrix 730 rows 378 cols
[2022-05-18 17:23:06] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:23:06] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
[2022-05-18 17:23:07] [INFO ] Flow matrix only has 730 transitions (discarded 12 similar events)
// Phase 1: matrix 730 rows 378 cols
[2022-05-18 17:23:07] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:23:07] [INFO ] Implicit Places using invariants in 326 ms returned []
[2022-05-18 17:23:07] [INFO ] Flow matrix only has 730 transitions (discarded 12 similar events)
// Phase 1: matrix 730 rows 378 cols
[2022-05-18 17:23:07] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:23:07] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:13] [INFO ] Implicit Places using invariants and state equation in 6176 ms returned []
Implicit Place search using SMT with State Equation took 6504 ms to find 0 implicit places.
[2022-05-18 17:23:13] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-18 17:23:13] [INFO ] Flow matrix only has 730 transitions (discarded 12 similar events)
// Phase 1: matrix 730 rows 378 cols
[2022-05-18 17:23:13] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:23:14] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/516 places, 742/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 378/516 places, 742/878 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p0), acceptance={} source=0 dest: 1}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(OR (AND (GEQ s12 8) (GEQ s105 2) (GEQ s302 1)) (AND (GEQ s238 1) (GEQ s350 1))), p0:(OR (LT s155 1) (LT s239 1)), p2:(AND (GEQ s9 1) (GEQ s55 1) (GEQ ...], 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 14014 steps with 12 reset in 47 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-09 finished in 7883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(((p0 U F(X(p1)))&&p2))) U (F(p0)&&p3))))'
Support contains 4 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 878
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 508 transition count 872
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 508 transition count 872
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 502 transition count 866
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 502 transition count 866
Applied a total of 26 rules in 27 ms. Remains 502 /516 variables (removed 14) and now considering 866/878 (removed 12) transitions.
[2022-05-18 17:23:14] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:23:14] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:23:15] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2022-05-18 17:23:15] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:23:15] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:23:15] [INFO ] Implicit Places using invariants in 383 ms returned []
[2022-05-18 17:23:15] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:23:15] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:23:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:24] [INFO ] Implicit Places using invariants and state equation in 8794 ms returned []
Implicit Place search using SMT with State Equation took 9179 ms to find 0 implicit places.
[2022-05-18 17:23:24] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:23:24] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:23:25] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 866/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/516 places, 866/878 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s85 1) (GEQ s158 1)), p0:(GEQ s50 1), p2:(GEQ s208 1), p1:(AND (GEQ s85 1) (GEQ s158 1))], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 6378 steps with 9 reset in 22 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-10 finished in 11179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 514 transition count 824
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 108 place count 460 transition count 764
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 228 place count 400 transition count 764
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 231 place count 397 transition count 761
Iterating global reduction 2 with 3 rules applied. Total rules applied 234 place count 397 transition count 761
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 330 place count 349 transition count 713
Applied a total of 330 rules in 46 ms. Remains 349 /516 variables (removed 167) and now considering 713/878 (removed 165) transitions.
[2022-05-18 17:23:25] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:25] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 17:23:25] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
[2022-05-18 17:23:25] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:25] [INFO ] Computed 42 place invariants in 14 ms
[2022-05-18 17:23:26] [INFO ] Implicit Places using invariants in 338 ms returned []
[2022-05-18 17:23:26] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:26] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:23:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:31] [INFO ] Implicit Places using invariants and state equation in 5114 ms returned []
Implicit Place search using SMT with State Equation took 5457 ms to find 0 implicit places.
[2022-05-18 17:23:31] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-18 17:23:31] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2022-05-18 17:23:31] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 17:23:31] [INFO ] Dead Transitions using invariants and state equation in 451 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/516 places, 713/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 349/516 places, 713/878 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-12 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:(AND (GEQ s205 1) (GEQ s329 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 462 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-12 finished in 6531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((!(false U false)&&!G(X(p0)))) U p1))'
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 514 transition count 827
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 463 transition count 826
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 462 transition count 826
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 104 place count 462 transition count 766
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 224 place count 402 transition count 766
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 226 place count 400 transition count 764
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 400 transition count 764
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 322 place count 353 transition count 717
Applied a total of 322 rules in 56 ms. Remains 353 /516 variables (removed 163) and now considering 717/878 (removed 161) transitions.
[2022-05-18 17:23:32] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:32] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:23:32] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
[2022-05-18 17:23:32] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:32] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:23:32] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-18 17:23:32] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:32] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 17:23:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:36] [INFO ] Implicit Places using invariants and state equation in 3803 ms returned []
Implicit Place search using SMT with State Equation took 4127 ms to find 0 implicit places.
[2022-05-18 17:23:36] [INFO ] Redundant transitions in 13 ms returned []
[2022-05-18 17:23:36] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:36] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 17:23:37] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/516 places, 717/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 353/516 places, 717/878 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), p0, p0]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s308 1), p0:(GEQ s251 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 633 reset in 315 ms.
Product exploration explored 100000 steps with 666 reset in 362 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 (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), p0, p0]
Finished random walk after 198 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 355 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), p0, p0]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), p0, p0]
[2022-05-18 17:23:38] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:38] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 17:23:39] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-05-18 17:23:39] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 90 ms returned sat
[2022-05-18 17:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 17:23:40] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2022-05-18 17:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 17:23:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-18 17:23:40] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 36 ms returned sat
[2022-05-18 17:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 17:23:42] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2022-05-18 17:23:42] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 292 ms returned sat
[2022-05-18 17:23:42] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 0 ms to minimize.
[2022-05-18 17:23:42] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 0 ms to minimize.
[2022-05-18 17:23:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2022-05-18 17:23:42] [INFO ] Computed and/alt/rep : 433/1948/427 causal constraints (skipped 276 transitions) in 77 ms.
[2022-05-18 17:23:45] [INFO ] Added : 254 causal constraints over 51 iterations in 2851 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 717/717 transitions.
Applied a total of 0 rules in 14 ms. Remains 353 /353 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2022-05-18 17:23:45] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:45] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 17:23:45] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
[2022-05-18 17:23:45] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:45] [INFO ] Computed 42 place invariants in 6 ms
[2022-05-18 17:23:46] [INFO ] Implicit Places using invariants in 319 ms returned []
[2022-05-18 17:23:46] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:46] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 17:23:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:50] [INFO ] Implicit Places using invariants and state equation in 3947 ms returned []
Implicit Place search using SMT with State Equation took 4269 ms to find 0 implicit places.
[2022-05-18 17:23:50] [INFO ] Redundant transitions in 15 ms returned []
[2022-05-18 17:23:50] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:50] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:23:50] [INFO ] Dead Transitions using invariants and state equation in 466 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 717/717 transitions.
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 (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 262 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), p0, p0]
Finished random walk after 84 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 333 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), p0, p0]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), p0, p0]
[2022-05-18 17:23:51] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:23:51] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:23:51] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-18 17:23:52] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 88 ms returned sat
[2022-05-18 17:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 17:23:52] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2022-05-18 17:23:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 17:23:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2022-05-18 17:23:53] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 37 ms returned sat
[2022-05-18 17:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 17:23:54] [INFO ] [Nat]Absence check using state equation in 1169 ms returned sat
[2022-05-18 17:23:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:23:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 287 ms returned sat
[2022-05-18 17:23:54] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2022-05-18 17:23:54] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2022-05-18 17:23:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2022-05-18 17:23:54] [INFO ] Computed and/alt/rep : 433/1948/427 causal constraints (skipped 276 transitions) in 58 ms.
[2022-05-18 17:23:57] [INFO ] Added : 254 causal constraints over 51 iterations in 2767 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), p0, p0]
Product exploration explored 100000 steps with 589 reset in 292 ms.
Product exploration explored 100000 steps with 525 reset in 333 ms.
Built C files in :
/tmp/ltsmin15616909508708258853
[2022-05-18 17:23:58] [INFO ] Computing symmetric may disable matrix : 717 transitions.
[2022-05-18 17:23:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:23:58] [INFO ] Computing symmetric may enable matrix : 717 transitions.
[2022-05-18 17:23:58] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:23:58] [INFO ] Computing Do-Not-Accords matrix : 717 transitions.
[2022-05-18 17:23:58] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:23:58] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15616909508708258853
Running compilation step : cd /tmp/ltsmin15616909508708258853;'/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 1751 ms.
Running link step : cd /tmp/ltsmin15616909508708258853;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin15616909508708258853;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2593182888367857769.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 353 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 353/353 places, 717/717 transitions.
Applied a total of 0 rules in 12 ms. Remains 353 /353 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2022-05-18 17:24:13] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:24:13] [INFO ] Computed 42 place invariants in 10 ms
[2022-05-18 17:24:13] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
[2022-05-18 17:24:13] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:24:13] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:24:14] [INFO ] Implicit Places using invariants in 323 ms returned []
[2022-05-18 17:24:14] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:24:14] [INFO ] Computed 42 place invariants in 6 ms
[2022-05-18 17:24:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:24:17] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
[2022-05-18 17:24:17] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-18 17:24:17] [INFO ] Flow matrix only has 705 transitions (discarded 12 similar events)
// Phase 1: matrix 705 rows 353 cols
[2022-05-18 17:24:17] [INFO ] Computed 42 place invariants in 9 ms
[2022-05-18 17:24:17] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 717/717 transitions.
Built C files in :
/tmp/ltsmin6079969807666306606
[2022-05-18 17:24:17] [INFO ] Computing symmetric may disable matrix : 717 transitions.
[2022-05-18 17:24:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:24:17] [INFO ] Computing symmetric may enable matrix : 717 transitions.
[2022-05-18 17:24:17] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:24:17] [INFO ] Computing Do-Not-Accords matrix : 717 transitions.
[2022-05-18 17:24:17] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 17:24:17] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6079969807666306606
Running compilation step : cd /tmp/ltsmin6079969807666306606;'/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 1769 ms.
Running link step : cd /tmp/ltsmin6079969807666306606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6079969807666306606;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5741623804801848797.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-18 17:24:33] [INFO ] Flatten gal took : 29 ms
[2022-05-18 17:24:33] [INFO ] Flatten gal took : 28 ms
[2022-05-18 17:24:33] [INFO ] Time to serialize gal into /tmp/LTL17518835454542527130.gal : 5 ms
[2022-05-18 17:24:33] [INFO ] Time to serialize properties into /tmp/LTL4485376479696768874.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17518835454542527130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4485376479696768874.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1751883...267
Read 1 LTL properties
Checking formula 0 : !(((G(!(G(X("(Try_Check_Sources_B_1>=1)")))))U("(NotifyEventJobCompletedE_3>=1)")))
Formula 0 simplified : !(G!GX"(Try_Check_Sources_B_1>=1)" U "(NotifyEventJobCompletedE_3>=1)")
Detected timeout of ITS tools.
[2022-05-18 17:24:48] [INFO ] Flatten gal took : 32 ms
[2022-05-18 17:24:48] [INFO ] Applying decomposition
[2022-05-18 17:24:48] [INFO ] Flatten gal took : 29 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/graph5910604769922113014.txt' '-o' '/tmp/graph5910604769922113014.bin' '-w' '/tmp/graph5910604769922113014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5910604769922113014.bin' '-l' '-1' '-v' '-w' '/tmp/graph5910604769922113014.weights' '-q' '0' '-e' '0.001'
[2022-05-18 17:24:48] [INFO ] Decomposing Gal with order
[2022-05-18 17:24:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 17:24:48] [INFO ] Removed a total of 549 redundant transitions.
[2022-05-18 17:24:48] [INFO ] Flatten gal took : 97 ms
[2022-05-18 17:24:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 525 labels/synchronizations in 20 ms.
[2022-05-18 17:24:48] [INFO ] Time to serialize gal into /tmp/LTL8120991573168907103.gal : 6 ms
[2022-05-18 17:24:48] [INFO ] Time to serialize properties into /tmp/LTL4209007383165489018.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8120991573168907103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4209007383165489018.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8120991...245
Read 1 LTL properties
Checking formula 0 : !(((G(!(G(X("(i0.u17.Try_Check_Sources_B_1>=1)")))))U("(i0.u22.NotifyEventJobCompletedE_3>=1)")))
Formula 0 simplified : !(G!GX"(i0.u17.Try_Check_Sources_B_1>=1)" U "(i0.u22.NotifyEventJobCompletedE_3>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15808434857607102077
[2022-05-18 17:25:03] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15808434857607102077
Running compilation step : cd /tmp/ltsmin15808434857607102077;'/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 1131 ms.
Running link step : cd /tmp/ltsmin15808434857607102077;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15808434857607102077;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((!(false U false)&&)))) U (LTLAPp1==true))' '--buchi-type=spotba'
LTSmin run took 214 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-13 finished in 92919 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||p1) U (G(!G(p3))&&G(p0)&&p2))))'
Support contains 6 out of 516 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 514 transition count 878
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 508 transition count 872
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 508 transition count 872
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 20 place count 502 transition count 866
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 502 transition count 866
Applied a total of 26 rules in 33 ms. Remains 502 /516 variables (removed 14) and now considering 866/878 (removed 12) transitions.
[2022-05-18 17:25:04] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:25:04] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 17:25:05] [INFO ] Dead Transitions using invariants and state equation in 816 ms found 0 transitions.
[2022-05-18 17:25:05] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:25:05] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:25:06] [INFO ] Implicit Places using invariants in 394 ms returned []
[2022-05-18 17:25:06] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:25:06] [INFO ] Computed 42 place invariants in 12 ms
[2022-05-18 17:25:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:25:15] [INFO ] Implicit Places using invariants and state equation in 9496 ms returned []
Implicit Place search using SMT with State Equation took 9890 ms to find 0 implicit places.
[2022-05-18 17:25:15] [INFO ] Flow matrix only has 854 transitions (discarded 12 similar events)
// Phase 1: matrix 854 rows 502 cols
[2022-05-18 17:25:15] [INFO ] Computed 42 place invariants in 8 ms
[2022-05-18 17:25:16] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/516 places, 866/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 502/516 places, 866/878 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p0) p3), (OR (NOT p2) (NOT p0) p3), true, (NOT p0), (OR (NOT p0) p3), p3]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p0) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0 p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND p0 p3), acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s30 1) (GEQ s60 1)), p0:(AND (GEQ s30 1) (GEQ s60 1)), p1:(AND (GEQ s21 1) (GEQ s360 1)), p3:(AND (GEQ s318 1) (GEQ s463 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-14 finished in 11863 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 1 out of 516 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 516/516 places, 878/878 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 514 transition count 825
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 107 place count 461 transition count 824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 460 transition count 824
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 108 place count 460 transition count 764
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 228 place count 400 transition count 764
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 231 place count 397 transition count 761
Iterating global reduction 3 with 3 rules applied. Total rules applied 234 place count 397 transition count 761
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 328 place count 350 transition count 714
Applied a total of 328 rules in 42 ms. Remains 350 /516 variables (removed 166) and now considering 714/878 (removed 164) transitions.
[2022-05-18 17:25:16] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2022-05-18 17:25:16] [INFO ] Computed 42 place invariants in 7 ms
[2022-05-18 17:25:17] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
[2022-05-18 17:25:17] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2022-05-18 17:25:17] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:25:17] [INFO ] Implicit Places using invariants in 327 ms returned []
[2022-05-18 17:25:17] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2022-05-18 17:25:17] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 17:25:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-18 17:25:22] [INFO ] Implicit Places using invariants and state equation in 4486 ms returned []
Implicit Place search using SMT with State Equation took 4814 ms to find 0 implicit places.
[2022-05-18 17:25:22] [INFO ] Redundant transitions in 7 ms returned []
[2022-05-18 17:25:22] [INFO ] Flow matrix only has 702 transitions (discarded 12 similar events)
// Phase 1: matrix 702 rows 350 cols
[2022-05-18 17:25:22] [INFO ] Computed 42 place invariants in 13 ms
[2022-05-18 17:25:22] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 350/516 places, 714/878 transitions.
Finished structural reductions, in 1 iterations. Remains : 350/516 places, 714/878 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S02J06T06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 43 reset in 300 ms.
Stack based approach found an accepted trace after 1161 steps with 1 reset with depth 373 and stack size 373 in 4 ms.
FORMULA PolyORBLF-PT-S02J06T06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S02J06T06-LTLFireability-15 finished in 6187 ms.
All properties solved by simple procedures.
Total runtime 287905 ms.
BK_STOP 1652894723025
--------------------
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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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-165277016900612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;