About the Execution of ITS-Tools for DoubleExponent-PT-003
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1653.447 | 63367.00 | 138802.00 | 680.30 | TFFFFFTTFFFTTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r133-smll-167819411100460.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100460
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678468252731
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 17:10:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 17:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:10:56] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-10 17:10:56] [INFO ] Transformed 163 places.
[2023-03-10 17:10:56] [INFO ] Transformed 148 transitions.
[2023-03-10 17:10:56] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 38 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2023-03-10 17:10:56] [INFO ] Computed 16 place invariants in 16 ms
[2023-03-10 17:10:57] [INFO ] Implicit Places using invariants in 410 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 467 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 35 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-10 17:10:57] [INFO ] Computed 14 place invariants in 9 ms
[2023-03-10 17:10:57] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-10 17:10:57] [INFO ] Invariant cache hit.
[2023-03-10 17:10:57] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/163 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1147 ms. Remains : 156/163 places, 147/148 transitions.
Support contains 38 out of 156 places after structural reductions.
[2023-03-10 17:10:58] [INFO ] Flatten gal took : 78 ms
[2023-03-10 17:10:58] [INFO ] Flatten gal took : 33 ms
[2023-03-10 17:10:58] [INFO ] Input system was already deterministic with 147 transitions.
Support contains 36 out of 156 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-10 17:10:59] [INFO ] Invariant cache hit.
[2023-03-10 17:10:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:10:59] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-10 17:11:00] [INFO ] After 174ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:14
[2023-03-10 17:11:00] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 7 ms to minimize.
[2023-03-10 17:11:00] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-03-10 17:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-10 17:11:00] [INFO ] After 377ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-10 17:11:00] [INFO ] After 574ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-10 17:11:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:00] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 17:11:00] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-10 17:11:00] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2023-03-10 17:11:00] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 2 ms to minimize.
[2023-03-10 17:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-10 17:11:01] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-10 17:11:01] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2023-03-10 17:11:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2023-03-10 17:11:01] [INFO ] After 866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 212 ms.
[2023-03-10 17:11:01] [INFO ] After 1288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 22 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 155 transition count 125
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 48 place count 134 transition count 120
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 129 transition count 120
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 53 place count 129 transition count 111
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 71 place count 120 transition count 111
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 109 place count 101 transition count 92
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 97 transition count 92
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 122 place count 97 transition count 87
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 127 place count 92 transition count 87
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 135 place count 92 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 91 transition count 86
Applied a total of 136 rules in 60 ms. Remains 91 /156 variables (removed 65) and now considering 86/147 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 91/156 places, 86/147 transitions.
Incomplete random walk after 10000 steps, including 1056 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 753 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 741 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 727 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 743 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 775 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 729 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 734 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 770 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 745 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 746 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 768 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 86 rows 91 cols
[2023-03-10 17:11:04] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-10 17:11:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:04] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-10 17:11:04] [INFO ] After 93ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:10
[2023-03-10 17:11:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:04] [INFO ] After 35ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 17:11:04] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-10 17:11:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:04] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 17:11:05] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-10 17:11:05] [INFO ] After 106ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-10 17:11:05] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-10 17:11:05] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 86/86 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 88 transition count 83
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 82
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 87 transition count 82
Applied a total of 10 rules in 29 ms. Remains 87 /91 variables (removed 4) and now considering 82/86 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 87/91 places, 82/86 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 819 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 853 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 11) seen :0
Finished probabilistic random walk after 115957 steps, run visited all 11 properties in 1455 ms. (steps per millisecond=79 )
Probabilistic random walk after 115957 steps, saw 58014 distinct states, run finished after 1455 ms. (steps per millisecond=79 ) properties seen :11
FORMULA DoubleExponent-PT-003-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 75 place count 117 transition count 102
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 87 place count 111 transition count 102
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 143 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 151 place count 79 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 78 transition count 73
Applied a total of 153 rules in 46 ms. Remains 78 /156 variables (removed 78) and now considering 73/147 (removed 74) transitions.
// Phase 1: matrix 73 rows 78 cols
[2023-03-10 17:11:09] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-10 17:11:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-10 17:11:09] [INFO ] Invariant cache hit.
[2023-03-10 17:11:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:09] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-10 17:11:09] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 17:11:09] [INFO ] Invariant cache hit.
[2023-03-10 17:11:09] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/156 places, 73/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 440 ms. Remains : 78/156 places, 73/147 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s74 1)), p0:(GEQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13866 reset in 483 ms.
Product exploration explored 100000 steps with 13893 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1370 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 810 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3378 steps, run visited all 2 properties in 21 ms. (steps per millisecond=160 )
Probabilistic random walk after 3378 steps, saw 1715 distinct states, run finished after 21 ms. (steps per millisecond=160 ) properties seen :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 451 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 73/73 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-10 17:11:12] [INFO ] Invariant cache hit.
[2023-03-10 17:11:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 17:11:12] [INFO ] Invariant cache hit.
[2023-03-10 17:11:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:12] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-10 17:11:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 17:11:12] [INFO ] Invariant cache hit.
[2023-03-10 17:11:12] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 78/78 places, 73/73 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 806 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-10 17:11:13] [INFO ] Invariant cache hit.
[2023-03-10 17:11:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:11:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-10 17:11:13] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 17:11:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:11:13] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-10 17:11:13] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 17:11:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:13] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 17:11:13] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-10 17:11:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-10 17:11:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2023-03-10 17:11:13] [INFO ] After 142ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 17:11:13] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 73/73 transitions.
Graph (complete) has 216 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 77 transition count 72
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 77 transition count 64
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 69 transition count 64
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 30 place count 69 transition count 64
Applied a total of 30 rules in 26 ms. Remains 69 /78 variables (removed 9) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 69/78 places, 64/73 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 823 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2004 steps, run visited all 1 properties in 25 ms. (steps per millisecond=80 )
Probabilistic random walk after 2004 steps, saw 1032 distinct states, run finished after 26 ms. (steps per millisecond=77 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 364 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13848 reset in 220 ms.
Product exploration explored 100000 steps with 13977 reset in 242 ms.
Built C files in :
/tmp/ltsmin6292009445027399726
[2023-03-10 17:11:15] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2023-03-10 17:11:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:15] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2023-03-10 17:11:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:15] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2023-03-10 17:11:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:15] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6292009445027399726
Running compilation step : cd /tmp/ltsmin6292009445027399726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 589 ms.
Running link step : cd /tmp/ltsmin6292009445027399726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin6292009445027399726;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2084938574285322472.hoa' '--buchi-type=spotba'
LTSmin run took 9612 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 16189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
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 35 place count 154 transition count 111
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 120 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 119 transition count 103
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 112 transition count 103
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 137 place count 86 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 82 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 81 transition count 76
Applied a total of 146 rules in 31 ms. Remains 81 /156 variables (removed 75) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 81 cols
[2023-03-10 17:11:25] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-10 17:11:25] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-10 17:11:25] [INFO ] Invariant cache hit.
[2023-03-10 17:11:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:11:25] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-10 17:11:25] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 17:11:25] [INFO ] Invariant cache hit.
[2023-03-10 17:11:26] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/156 places, 76/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 81/156 places, 76/147 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(LT s44 1), p0:(AND (GEQ s6 1) (GEQ s13 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 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-01 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 154 transition count 113
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 122 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 119 transition count 110
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 71 place count 119 transition count 104
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 113 transition count 104
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 137 place count 86 transition count 77
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 143 place count 83 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 82 transition count 76
Applied a total of 145 rules in 42 ms. Remains 82 /156 variables (removed 74) and now considering 76/147 (removed 71) transitions.
// Phase 1: matrix 76 rows 82 cols
[2023-03-10 17:11:26] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:26] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-10 17:11:26] [INFO ] Invariant cache hit.
[2023-03-10 17:11:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:26] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-10 17:11:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:26] [INFO ] Invariant cache hit.
[2023-03-10 17:11:26] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/156 places, 76/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 82/156 places, 76/147 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s21 1) (AND (GEQ s47 1) (GEQ s74 1)) (AND (GEQ s3 1) (GEQ s43 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-02 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 75 place count 117 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 110 transition count 101
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 145 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 77 transition count 72
Applied a total of 154 rules in 28 ms. Remains 77 /156 variables (removed 79) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 77 cols
[2023-03-10 17:11:26] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-10 17:11:26] [INFO ] Invariant cache hit.
[2023-03-10 17:11:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:27] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-10 17:11:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:27] [INFO ] Invariant cache hit.
[2023-03-10 17:11:27] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/156 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 430 ms. Remains : 77/156 places, 72/147 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-03 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 154 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 118 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 73 place count 118 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 112 transition count 103
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 141 place count 84 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 80 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 79 transition count 74
Applied a total of 150 rules in 29 ms. Remains 79 /156 variables (removed 77) and now considering 74/147 (removed 73) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-10 17:11:27] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:27] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-10 17:11:27] [INFO ] Invariant cache hit.
[2023-03-10 17:11:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:27] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-10 17:11:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:27] [INFO ] Invariant cache hit.
[2023-03-10 17:11:27] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/156 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 79/156 places, 74/147 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s35 1) (GEQ s39 1)), p1:(OR (AND (GEQ s35 1) (GEQ s39 1)) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-04 finished in 711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 154 transition count 109
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 118 transition count 109
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 73 place count 118 transition count 102
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 87 place count 111 transition count 102
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 141 place count 84 transition count 75
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 149 place count 80 transition count 75
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 80 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 151 place count 79 transition count 74
Applied a total of 151 rules in 31 ms. Remains 79 /156 variables (removed 77) and now considering 74/147 (removed 73) transitions.
// Phase 1: matrix 74 rows 79 cols
[2023-03-10 17:11:28] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:28] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 17:11:28] [INFO ] Invariant cache hit.
[2023-03-10 17:11:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:28] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-10 17:11:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:28] [INFO ] Invariant cache hit.
[2023-03-10 17:11:28] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/156 places, 74/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 79/156 places, 74/147 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s24 1)), p1:(AND (GEQ s40 1) (GEQ s51 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-05 finished in 658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1&&X(p2))))))'
Support contains 6 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-10 17:11:28] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:28] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-10 17:11:28] [INFO ] Invariant cache hit.
[2023-03-10 17:11:29] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-10 17:11:29] [INFO ] Invariant cache hit.
[2023-03-10 17:11:29] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s81 1)), p1:(AND (GEQ s13 1) (GEQ s49 1)), p2:(OR (LT s110 1) (LT s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3291 reset in 170 ms.
Product exploration explored 100000 steps with 3299 reset in 346 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1002 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 239287 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{1=1, 3=1, 6=1}
Probabilistic random walk after 239287 steps, saw 119654 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :3
Running SMT prover for 5 properties.
[2023-03-10 17:11:36] [INFO ] Invariant cache hit.
[2023-03-10 17:11:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:11:36] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-10 17:11:36] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-10 17:11:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:36] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 17:11:36] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2023-03-10 17:11:36] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-10 17:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-10 17:11:36] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 17:11:36] [INFO ] After 303ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 154 transition count 110
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 118 transition count 109
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 74 place count 118 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 90 place count 110 transition count 101
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 144 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 152 place count 79 transition count 74
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 79 transition count 65
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 70 transition count 65
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 181 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 69 transition count 64
Applied a total of 182 rules in 25 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1297 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 842 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 118868 steps, run visited all 1 properties in 376 ms. (steps per millisecond=316 )
Probabilistic random walk after 118868 steps, saw 59464 distinct states, run finished after 376 ms. (steps per millisecond=316 ) properties seen :1
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p2) p0 p1))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND (NOT p0) p1))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))
Knowledge based reduction with 21 factoid took 885 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-06 finished in 9158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 154 transition count 108
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 117 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 75 place count 117 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 89 place count 110 transition count 101
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 147 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 76 transition count 71
Applied a total of 156 rules in 20 ms. Remains 76 /156 variables (removed 80) and now considering 71/147 (removed 76) transitions.
// Phase 1: matrix 71 rows 76 cols
[2023-03-10 17:11:37] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:38] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-10 17:11:38] [INFO ] Invariant cache hit.
[2023-03-10 17:11:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:38] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-10 17:11:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:38] [INFO ] Invariant cache hit.
[2023-03-10 17:11:38] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/156 places, 71/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 76/156 places, 71/147 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p2)||p1))))'
Support contains 5 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-10 17:11:38] [INFO ] Computed 14 place invariants in 5 ms
[2023-03-10 17:11:38] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-10 17:11:38] [INFO ] Invariant cache hit.
[2023-03-10 17:11:38] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-10 17:11:38] [INFO ] Invariant cache hit.
[2023-03-10 17:11:39] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(OR (LT s12 1) (LT s82 1)), p2:(LT s5 1), p1:(OR (LT s38 1) (LT s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 682 ms.
Product exploration explored 100000 steps with 50000 reset in 362 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p2)))
Knowledge based reduction with 14 factoid took 357 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 2527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-10 17:11:40] [INFO ] Invariant cache hit.
[2023-03-10 17:11:41] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-10 17:11:41] [INFO ] Invariant cache hit.
[2023-03-10 17:11:41] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-03-10 17:11:41] [INFO ] Invariant cache hit.
[2023-03-10 17:11:41] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 749 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s76 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 6250 reset in 162 ms.
Product exploration explored 100000 steps with 6250 reset in 346 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-10 17:11:42] [INFO ] Invariant cache hit.
[2023-03-10 17:11:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:43] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-10 17:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:11:43] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-10 17:11:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:11:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:11:43] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 9 ms returned sat
[2023-03-10 17:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:11:43] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-10 17:11:43] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2023-03-10 17:11:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 605 ms
[2023-03-10 17:11:44] [INFO ] Computed and/alt/rep : 146/279/146 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-10 17:11:44] [INFO ] Added : 74 causal constraints over 15 iterations in 554 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 154 transition count 107
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 116 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 116 transition count 102
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 111 transition count 102
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 145 place count 82 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 79 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 78 transition count 72
Applied a total of 152 rules in 21 ms. Remains 78 /156 variables (removed 78) and now considering 72/147 (removed 75) transitions.
// Phase 1: matrix 72 rows 78 cols
[2023-03-10 17:11:45] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-10 17:11:45] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 17:11:45] [INFO ] Invariant cache hit.
[2023-03-10 17:11:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:45] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-10 17:11:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:45] [INFO ] Invariant cache hit.
[2023-03-10 17:11:45] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/156 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 78/156 places, 72/147 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
[2023-03-10 17:11:46] [INFO ] Invariant cache hit.
[2023-03-10 17:11:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 17:11:46] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-10 17:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:11:46] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-10 17:11:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:11:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 17:11:46] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 8 ms returned sat
[2023-03-10 17:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:11:46] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-10 17:11:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 17:11:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 11 ms returned sat
[2023-03-10 17:11:46] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-10 17:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-10 17:11:46] [INFO ] Computed and/alt/rep : 71/215/71 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-10 17:11:46] [INFO ] Added : 22 causal constraints over 5 iterations in 114 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 213 ms.
Product exploration explored 100000 steps with 25000 reset in 236 ms.
Built C files in :
/tmp/ltsmin6219387600950047437
[2023-03-10 17:11:47] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2023-03-10 17:11:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:47] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2023-03-10 17:11:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:47] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2023-03-10 17:11:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6219387600950047437
Running compilation step : cd /tmp/ltsmin6219387600950047437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin6219387600950047437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6219387600950047437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14682032364963975300.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-12 finished in 6644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 154 transition count 112
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 121 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 120 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 120 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 114 transition count 105
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 139 place count 85 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 81 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 80 transition count 75
Applied a total of 148 rules in 13 ms. Remains 80 /156 variables (removed 76) and now considering 75/147 (removed 72) transitions.
// Phase 1: matrix 75 rows 80 cols
[2023-03-10 17:11:47] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 17:11:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-10 17:11:47] [INFO ] Invariant cache hit.
[2023-03-10 17:11:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:11:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-10 17:11:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:11:47] [INFO ] Invariant cache hit.
[2023-03-10 17:11:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/156 places, 75/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 80/156 places, 75/147 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s5 1) (GEQ s12 1)), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13856 reset in 153 ms.
Product exploration explored 100000 steps with 13889 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1386 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 836 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3198 steps, run visited all 3 properties in 40 ms. (steps per millisecond=79 )
Probabilistic random walk after 3198 steps, saw 1625 distinct states, run finished after 40 ms. (steps per millisecond=79 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 528 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-10 17:11:50] [INFO ] Invariant cache hit.
[2023-03-10 17:11:50] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 17:11:50] [INFO ] Invariant cache hit.
[2023-03-10 17:11:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 17:11:50] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-10 17:11:50] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 17:11:50] [INFO ] Invariant cache hit.
[2023-03-10 17:11:50] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 80/80 places, 75/75 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 228 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 363 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 828 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 822 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3198 steps, run visited all 3 properties in 38 ms. (steps per millisecond=84 )
Probabilistic random walk after 3198 steps, saw 1625 distinct states, run finished after 38 ms. (steps per millisecond=84 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 413 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13907 reset in 154 ms.
Product exploration explored 100000 steps with 13949 reset in 139 ms.
Built C files in :
/tmp/ltsmin7219059701823473108
[2023-03-10 17:11:52] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2023-03-10 17:11:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:52] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2023-03-10 17:11:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:52] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2023-03-10 17:11:52] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 17:11:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7219059701823473108
Running compilation step : cd /tmp/ltsmin7219059701823473108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin7219059701823473108;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7219059701823473108;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13328692137830187892.hoa' '--buchi-type=spotba'
LTSmin run took 213 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-13 finished in 5469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2023-03-10 17:11:53] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-10 17:11:53] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-10 17:11:53] [INFO ] Invariant cache hit.
[2023-03-10 17:11:53] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-10 17:11:53] [INFO ] Invariant cache hit.
[2023-03-10 17:11:53] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&G(p1)))))'
Support contains 3 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
[2023-03-10 17:11:54] [INFO ] Invariant cache hit.
[2023-03-10 17:11:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-10 17:11:54] [INFO ] Invariant cache hit.
[2023-03-10 17:11:54] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-10 17:11:54] [INFO ] Invariant cache hit.
[2023-03-10 17:11:54] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 705 ms. Remains : 156/156 places, 147/147 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(LT s71 1), p0:(OR (LT s61 1) (LT s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 1018 ms.
All properties solved by simple procedures.
Total runtime 58762 ms.
BK_STOP 1678468316098
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DoubleExponent-PT-003"
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-5348"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-003, 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 r133-smll-167819411100460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 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 ;