About the Execution of ITS-Tools for DoubleExponent-PT-004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5679.920 | 3600000.00 | 13511108.00 | 1635.20 | FTFTT?F??FFFFF?F | 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-167819411100468.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-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411100468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.4K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 8.6K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K 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 67K 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-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678472447362
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-004
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 18:20:50] [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 18:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:20:50] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-10 18:20:50] [INFO ] Transformed 216 places.
[2023-03-10 18:20:50] [INFO ] Transformed 198 transitions.
[2023-03-10 18:20:50] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-004-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 36 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2023-03-10 18:20:50] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-10 18:20:51] [INFO ] Implicit Places using invariants in 479 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 525 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 41 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-10 18:20:51] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-10 18:20:51] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-10 18:20:51] [INFO ] Invariant cache hit.
[2023-03-10 18:20:52] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1407 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 35 out of 209 places after structural reductions.
[2023-03-10 18:20:52] [INFO ] Flatten gal took : 63 ms
[2023-03-10 18:20:52] [INFO ] Flatten gal took : 25 ms
[2023-03-10 18:20:52] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 10000 steps, including 339 resets, run finished after 810 ms. (steps per millisecond=12 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-10 18:20:53] [INFO ] Invariant cache hit.
[2023-03-10 18:20:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:20:53] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-10 18:20:54] [INFO ] After 182ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-10 18:20:54] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 12 ms to minimize.
[2023-03-10 18:20:54] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2023-03-10 18:20:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-03-10 18:20:54] [INFO ] After 496ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 18:20:54] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-10 18:20:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:20:54] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-10 18:20:55] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :16
[2023-03-10 18:20:55] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2023-03-10 18:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-10 18:20:55] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 2 ms to minimize.
[2023-03-10 18:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-10 18:20:55] [INFO ] After 1121ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :16
Attempting to minimize the solution found.
Minimization took 375 ms.
[2023-03-10 18:20:56] [INFO ] After 1781ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :16
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 673 ms.
Support contains 22 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 208 transition count 171
Reduce places removed 25 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 35 rules applied. Total rules applied 61 place count 183 transition count 161
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 71 place count 173 transition count 161
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 71 place count 173 transition count 150
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 93 place count 162 transition count 150
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 145 place count 136 transition count 124
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 155 place count 131 transition count 124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 165 place count 131 transition count 114
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 175 place count 121 transition count 114
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 191 place count 121 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 192 place count 120 transition count 113
Applied a total of 192 rules in 88 ms. Remains 120 /209 variables (removed 89) and now considering 113/197 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 120/209 places, 113/197 transitions.
Incomplete random walk after 10000 steps, including 777 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 67 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 59 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 63 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 113 rows 120 cols
[2023-03-10 18:20:57] [INFO ] Computed 19 place invariants in 10 ms
[2023-03-10 18:20:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:20:57] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:20:58] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-10 18:20:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-10 18:20:58] [INFO ] After 13ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 18:20:58] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 18:20:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:20:58] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:20:58] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-10 18:20:58] [INFO ] After 131ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-10 18:20:58] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-10 18:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-10 18:20:58] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2023-03-10 18:20:58] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2023-03-10 18:20:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-10 18:20:58] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2023-03-10 18:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-10 18:20:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-10 18:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-10 18:20:58] [INFO ] After 571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-10 18:20:59] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 329 ms.
Support contains 16 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 113/113 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 120 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 119 transition count 112
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 114 transition count 107
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 112 transition count 105
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 112 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 111 transition count 104
Applied a total of 19 rules in 35 ms. Remains 111 /120 variables (removed 9) and now considering 104/113 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 111/120 places, 104/113 transitions.
Incomplete random walk after 10000 steps, including 1122 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 793 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 746 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 786 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 770 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 784 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 774 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 749 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 781 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 781 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 791 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 773 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 240409 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{1=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 240409 steps, saw 120250 distinct states, run finished after 3003 ms. (steps per millisecond=80 ) properties seen :8
Running SMT prover for 4 properties.
// Phase 1: matrix 104 rows 111 cols
[2023-03-10 18:21:04] [INFO ] Computed 19 place invariants in 5 ms
[2023-03-10 18:21:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:04] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:21:04] [INFO ] After 90ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 18:21:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-10 18:21:04] [INFO ] After 21ms SMT Verify possible using 11 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:04] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:04] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-10 18:21:04] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:04] [INFO ] After 50ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-10 18:21:04] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2023-03-10 18:21:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2023-03-10 18:21:04] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-10 18:21:04] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 75 ms.
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 104/104 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 109 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 104 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 102 transition count 98
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 102 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 98 transition count 94
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 98 transition count 94
Applied a total of 28 rules in 32 ms. Remains 98 /111 variables (removed 13) and now considering 94/104 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 98/111 places, 94/104 transitions.
Incomplete random walk after 10000 steps, including 1376 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 872 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 861 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 863 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 267966 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267966 steps, saw 134059 distinct states, run finished after 3002 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 94 rows 98 cols
[2023-03-10 18:21:08] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-10 18:21:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:21:08] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:21:08] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 18:21:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 18:21:08] [INFO ] After 21ms SMT Verify possible using 16 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:08] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:09] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:21:09] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:09] [INFO ] After 76ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:09] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2023-03-10 18:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-10 18:21:09] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-10 18:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-10 18:21:09] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-10 18:21:09] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 53 ms.
Support contains 6 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 98/98 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-10 18:21:09] [INFO ] Invariant cache hit.
[2023-03-10 18:21:09] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-10 18:21:09] [INFO ] Invariant cache hit.
[2023-03-10 18:21:09] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 18:21:09] [INFO ] Implicit Places using invariants and state equation in 359 ms returned [21, 28, 65, 70, 89, 95]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 487 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/98 places, 94/94 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 91
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 89 transition count 91
Applied a total of 6 rules in 10 ms. Remains 89 /92 variables (removed 3) and now considering 91/94 (removed 3) transitions.
// Phase 1: matrix 91 rows 89 cols
[2023-03-10 18:21:09] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-10 18:21:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-10 18:21:10] [INFO ] Invariant cache hit.
[2023-03-10 18:21:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 18:21:10] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 89/98 places, 91/94 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 924 ms. Remains : 89/98 places, 91/94 transitions.
Incomplete random walk after 10000 steps, including 1581 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 999 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 958 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 331871 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331871 steps, saw 165969 distinct states, run finished after 3005 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-10 18:21:13] [INFO ] Invariant cache hit.
[2023-03-10 18:21:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:21:13] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-10 18:21:13] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 18:21:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 18:21:13] [INFO ] After 19ms SMT Verify possible using 16 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:13] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:13] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 6 ms returned sat
[2023-03-10 18:21:13] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:14] [INFO ] After 48ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:14] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2023-03-10 18:21:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-10 18:21:14] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-10 18:21:14] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 37 ms.
Support contains 6 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 89/89 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 91/91 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-10 18:21:14] [INFO ] Invariant cache hit.
[2023-03-10 18:21:14] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-10 18:21:14] [INFO ] Invariant cache hit.
[2023-03-10 18:21:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-10 18:21:14] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-10 18:21:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 18:21:14] [INFO ] Invariant cache hit.
[2023-03-10 18:21:14] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 89/89 places, 91/91 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 89
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 87 transition count 84
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 82 transition count 84
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 79 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 79 transition count 81
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 79 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 78 transition count 80
Applied a total of 22 rules in 15 ms. Remains 78 /89 variables (removed 11) and now considering 80/91 (removed 11) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 80 rows 78 cols
[2023-03-10 18:21:14] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-10 18:21:14] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:14] [INFO ] [Real]Absence check using 2 positive and 11 generalized place invariants in 5 ms returned sat
[2023-03-10 18:21:14] [INFO ] After 65ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-10 18:21:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-10 18:21:14] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:14] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 18:21:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:21:14] [INFO ] [Nat]Absence check using 2 positive and 11 generalized place invariants in 4 ms returned sat
[2023-03-10 18:21:14] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:14] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 18:21:15] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-10 18:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-10 18:21:15] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-10 18:21:15] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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(G(!p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-10 18:21:15] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-10 18:21:15] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-10 18:21:15] [INFO ] Invariant cache hit.
[2023-03-10 18:21:15] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2023-03-10 18:21:15] [INFO ] Invariant cache hit.
[2023-03-10 18:21:16] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 713 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, p0, p0]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s126 1) (GEQ s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1525 steps with 52 reset in 20 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 1034 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&&X(F(!p1)))) U (!p0 U (p2||G(!p0))))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-10 18:21:16] [INFO ] Invariant cache hit.
[2023-03-10 18:21:16] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-10 18:21:16] [INFO ] Invariant cache hit.
[2023-03-10 18:21:17] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-10 18:21:17] [INFO ] Invariant cache hit.
[2023-03-10 18:21:17] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 908 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p1]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (LT s81 1) (LT s31 1)), p0:(GEQ s81 1), p1:(AND (GEQ s160 1) (GEQ s167 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 50000 reset in 411 ms.
Product exploration explored 100000 steps with 50000 reset in 406 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 6 factoid took 321 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 2238 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(F(p1))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-10 18:21:18] [INFO ] Invariant cache hit.
[2023-03-10 18:21:18] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 18:21:18] [INFO ] Invariant cache hit.
[2023-03-10 18:21:19] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-10 18:21:19] [INFO ] Invariant cache hit.
[2023-03-10 18:21:19] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s173 1), p0:(AND (GEQ s10 1) (GEQ s112 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 22 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 787 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 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 157 transition count 137
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 35 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2023-03-10 18:21:19] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-10 18:21:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 18:21:19] [INFO ] Invariant cache hit.
[2023-03-10 18:21:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:21:19] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-10 18:21:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 18:21:19] [INFO ] Invariant cache hit.
[2023-03-10 18:21:19] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s87 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]]
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 264 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 322 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/105 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 1100 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)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 97 place count 159 transition count 138
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 24 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2023-03-10 18:21:20] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-10 18:21:20] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-10 18:21:20] [INFO ] Invariant cache hit.
[2023-03-10 18:21:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:21:20] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-10 18:21:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 18:21:20] [INFO ] Invariant cache hit.
[2023-03-10 18:21:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 477 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s52 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13915 reset in 132 ms.
Product exploration explored 100000 steps with 13893 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1379 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 842 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 7 ms. (steps per millisecond=18 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 7 ms. (steps per millisecond=18 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-10 18:21:21] [INFO ] Invariant cache hit.
[2023-03-10 18:21:22] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 18:21:22] [INFO ] Invariant cache hit.
[2023-03-10 18:21:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:21:22] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-10 18:21:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 18:21:22] [INFO ] Invariant cache hit.
[2023-03-10 18:21:22] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1399 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 7 ms. (steps per millisecond=18 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 7 ms. (steps per millisecond=18 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13818 reset in 113 ms.
Product exploration explored 100000 steps with 13889 reset in 249 ms.
Built C files in :
/tmp/ltsmin17239939979091932961
[2023-03-10 18:21:23] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-10 18:21:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:23] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-10 18:21:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:23] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-10 18:21:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:23] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17239939979091932961
Running compilation step : cd /tmp/ltsmin17239939979091932961;'/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 465 ms.
Running link step : cd /tmp/ltsmin17239939979091932961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin17239939979091932961;'/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/stateBased6707433971434347626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-10 18:21:38] [INFO ] Invariant cache hit.
[2023-03-10 18:21:38] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-10 18:21:38] [INFO ] Invariant cache hit.
[2023-03-10 18:21:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:21:39] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-10 18:21:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 18:21:39] [INFO ] Invariant cache hit.
[2023-03-10 18:21:39] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 105/105 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin1566901441939777224
[2023-03-10 18:21:39] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-10 18:21:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:39] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-10 18:21:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:39] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-10 18:21:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:21:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1566901441939777224
Running compilation step : cd /tmp/ltsmin1566901441939777224;'/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 324 ms.
Running link step : cd /tmp/ltsmin1566901441939777224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1566901441939777224;'/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/stateBased18437293271612158403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 18:21:54] [INFO ] Flatten gal took : 12 ms
[2023-03-10 18:21:54] [INFO ] Flatten gal took : 11 ms
[2023-03-10 18:21:54] [INFO ] Time to serialize gal into /tmp/LTL15011717915355025691.gal : 4 ms
[2023-03-10 18:21:54] [INFO ] Time to serialize properties into /tmp/LTL436112797228166984.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15011717915355025691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut406941911226746022.hoa' '-atoms' '/tmp/LTL436112797228166984.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL436112797228166984.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut406941911226746022.hoa
Detected timeout of ITS tools.
[2023-03-10 18:22:09] [INFO ] Flatten gal took : 10 ms
[2023-03-10 18:22:09] [INFO ] Flatten gal took : 10 ms
[2023-03-10 18:22:09] [INFO ] Time to serialize gal into /tmp/LTL17128945425702890628.gal : 6 ms
[2023-03-10 18:22:09] [INFO ] Time to serialize properties into /tmp/LTL16358789668196883387.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17128945425702890628.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16358789668196883387.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p198<1)&&(p98<1))"))))
Formula 0 simplified : FG!"((p198<1)&&(p98<1))"
Detected timeout of ITS tools.
[2023-03-10 18:22:24] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:22:24] [INFO ] Applying decomposition
[2023-03-10 18:22:24] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1312613535316645034.txt' '-o' '/tmp/graph1312613535316645034.bin' '-w' '/tmp/graph1312613535316645034.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1312613535316645034.bin' '-l' '-1' '-v' '-w' '/tmp/graph1312613535316645034.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:22:24] [INFO ] Decomposing Gal with order
[2023-03-10 18:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:22:24] [INFO ] Removed a total of 63 redundant transitions.
[2023-03-10 18:22:24] [INFO ] Flatten gal took : 59 ms
[2023-03-10 18:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2023-03-10 18:22:24] [INFO ] Time to serialize gal into /tmp/LTL8693782166373557708.gal : 6 ms
[2023-03-10 18:22:24] [INFO ] Time to serialize properties into /tmp/LTL10336762685412930216.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8693782166373557708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10336762685412930216.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i2.u16.p198<1)&&(i6.u34.p98<1))"))))
Formula 0 simplified : FG!"((i2.u16.p198<1)&&(i6.u34.p98<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16990006878239575509
[2023-03-10 18:22:39] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16990006878239575509
Running compilation step : cd /tmp/ltsmin16990006878239575509;'/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 276 ms.
Running link step : cd /tmp/ltsmin16990006878239575509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16990006878239575509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 94353 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(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-10 18:22:54] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-10 18:22:55] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-10 18:22:55] [INFO ] Invariant cache hit.
[2023-03-10 18:22:55] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-10 18:22:55] [INFO ] Invariant cache hit.
[2023-03-10 18:22:55] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 735 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s178 1) (GEQ s197 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-06 finished in 849 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(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 161 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
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 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 25 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2023-03-10 18:22:55] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-10 18:22:55] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-10 18:22:55] [INFO ] Invariant cache hit.
[2023-03-10 18:22:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 18:22:56] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-10 18:22:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 18:22:56] [INFO ] Invariant cache hit.
[2023-03-10 18:22:56] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s36 1), p1:(AND (GEQ s88 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13902 reset in 313 ms.
Product exploration explored 100000 steps with 13884 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 207 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1402 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 833 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 25 ms. (steps per millisecond=221 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 26 ms. (steps per millisecond=212 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 138 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-10 18:22:57] [INFO ] Invariant cache hit.
[2023-03-10 18:22:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 18:22:57] [INFO ] Invariant cache hit.
[2023-03-10 18:22:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 18:22:57] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-10 18:22:57] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 18:22:57] [INFO ] Invariant cache hit.
[2023-03-10 18:22:58] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1380 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 787 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 22 ms. (steps per millisecond=251 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 22 ms. (steps per millisecond=251 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 137 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13907 reset in 115 ms.
Product exploration explored 100000 steps with 13914 reset in 129 ms.
Built C files in :
/tmp/ltsmin8291680860160158714
[2023-03-10 18:22:58] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2023-03-10 18:22:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:22:58] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2023-03-10 18:22:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:22:58] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2023-03-10 18:22:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:22:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8291680860160158714
Running compilation step : cd /tmp/ltsmin8291680860160158714;'/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 323 ms.
Running link step : cd /tmp/ltsmin8291680860160158714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8291680860160158714;'/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/stateBased1845347080235280344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-10 18:23:14] [INFO ] Invariant cache hit.
[2023-03-10 18:23:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-10 18:23:14] [INFO ] Invariant cache hit.
[2023-03-10 18:23:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-10 18:23:14] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-10 18:23:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 18:23:14] [INFO ] Invariant cache hit.
[2023-03-10 18:23:14] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 485 ms. Remains : 106/106 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin658329545949268538
[2023-03-10 18:23:14] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2023-03-10 18:23:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:23:14] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2023-03-10 18:23:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:23:14] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2023-03-10 18:23:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:23:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin658329545949268538
Running compilation step : cd /tmp/ltsmin658329545949268538;'/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 325 ms.
Running link step : cd /tmp/ltsmin658329545949268538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin658329545949268538;'/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/stateBased3310478352165990946.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 18:23:29] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:23:29] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:23:29] [INFO ] Time to serialize gal into /tmp/LTL6398391066159294130.gal : 3 ms
[2023-03-10 18:23:29] [INFO ] Time to serialize properties into /tmp/LTL7798777244286191597.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6398391066159294130.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9707928363357235973.hoa' '-atoms' '/tmp/LTL7798777244286191597.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7798777244286191597.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9707928363357235973.hoa
Detected timeout of ITS tools.
[2023-03-10 18:23:44] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:23:44] [INFO ] Flatten gal took : 8 ms
[2023-03-10 18:23:44] [INFO ] Time to serialize gal into /tmp/LTL8133079649256768524.gal : 2 ms
[2023-03-10 18:23:44] [INFO ] Time to serialize properties into /tmp/LTL10956504861052330437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8133079649256768524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10956504861052330437.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p158<1)")||(G(F("((p71>=1)&&(p89>=1))")))))))
Formula 0 simplified : FG(!"((p71>=1)&&(p89>=1))" & !"(p158<1)")
Detected timeout of ITS tools.
[2023-03-10 18:23:59] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:23:59] [INFO ] Applying decomposition
[2023-03-10 18:23:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5010643702021412749.txt' '-o' '/tmp/graph5010643702021412749.bin' '-w' '/tmp/graph5010643702021412749.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5010643702021412749.bin' '-l' '-1' '-v' '-w' '/tmp/graph5010643702021412749.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:23:59] [INFO ] Decomposing Gal with order
[2023-03-10 18:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:23:59] [INFO ] Removed a total of 50 redundant transitions.
[2023-03-10 18:23:59] [INFO ] Flatten gal took : 21 ms
[2023-03-10 18:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2023-03-10 18:23:59] [INFO ] Time to serialize gal into /tmp/LTL5541008640095956014.gal : 3 ms
[2023-03-10 18:23:59] [INFO ] Time to serialize properties into /tmp/LTL11617572170550925249.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5541008640095956014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11617572170550925249.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i6.i1.u10.p158<1)")||(G(F("((i6.i1.u24.p71>=1)&&(i6.i0.u21.p89>=1))")))))))
Formula 0 simplified : FG(!"((i6.i1.u24.p71>=1)&&(i6.i0.u21.p89>=1))" & !"(i6.i1.u10.p158<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin158839402129723781
[2023-03-10 18:24:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin158839402129723781
Running compilation step : cd /tmp/ltsmin158839402129723781;'/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 285 ms.
Running link step : cd /tmp/ltsmin158839402129723781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin158839402129723781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[](<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 94257 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 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 157 transition count 138
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 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 17 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2023-03-10 18:24:30] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-10 18:24:30] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 18:24:30] [INFO ] Invariant cache hit.
[2023-03-10 18:24:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:24:30] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-10 18:24:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 18:24:30] [INFO ] Invariant cache hit.
[2023-03-10 18:24:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13828 reset in 115 ms.
Product exploration explored 100000 steps with 13856 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1373 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 817 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 18 ms. (steps per millisecond=175 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 18 ms. (steps per millisecond=175 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-10 18:24:31] [INFO ] Invariant cache hit.
[2023-03-10 18:24:31] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-10 18:24:31] [INFO ] Invariant cache hit.
[2023-03-10 18:24:31] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:24:31] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-10 18:24:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:24:31] [INFO ] Invariant cache hit.
[2023-03-10 18:24:31] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 106/106 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1380 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 866 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 17 ms. (steps per millisecond=186 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 17 ms. (steps per millisecond=186 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13844 reset in 116 ms.
Product exploration explored 100000 steps with 13923 reset in 131 ms.
Built C files in :
/tmp/ltsmin13505259269188615641
[2023-03-10 18:24:32] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-10 18:24:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:32] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-10 18:24:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:32] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-10 18:24:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:32] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13505259269188615641
Running compilation step : cd /tmp/ltsmin13505259269188615641;'/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 310 ms.
Running link step : cd /tmp/ltsmin13505259269188615641;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13505259269188615641;'/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/stateBased8578766406807491347.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-10 18:24:47] [INFO ] Invariant cache hit.
[2023-03-10 18:24:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 18:24:47] [INFO ] Invariant cache hit.
[2023-03-10 18:24:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:24:47] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-10 18:24:47] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 18:24:47] [INFO ] Invariant cache hit.
[2023-03-10 18:24:48] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 490 ms. Remains : 106/106 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin826487335667631580
[2023-03-10 18:24:48] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-10 18:24:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:48] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-10 18:24:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:48] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-10 18:24:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:24:48] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin826487335667631580
Running compilation step : cd /tmp/ltsmin826487335667631580;'/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 309 ms.
Running link step : cd /tmp/ltsmin826487335667631580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin826487335667631580;'/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/stateBased15841826847042500938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 18:25:03] [INFO ] Flatten gal took : 12 ms
[2023-03-10 18:25:03] [INFO ] Flatten gal took : 11 ms
[2023-03-10 18:25:03] [INFO ] Time to serialize gal into /tmp/LTL16666160061669142279.gal : 2 ms
[2023-03-10 18:25:03] [INFO ] Time to serialize properties into /tmp/LTL11350605902928832015.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16666160061669142279.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1199866018159743013.hoa' '-atoms' '/tmp/LTL11350605902928832015.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11350605902928832015.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1199866018159743013.hoa
Detected timeout of ITS tools.
[2023-03-10 18:25:18] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:25:18] [INFO ] Flatten gal took : 7 ms
[2023-03-10 18:25:18] [INFO ] Time to serialize gal into /tmp/LTL432435842447693521.gal : 1 ms
[2023-03-10 18:25:18] [INFO ] Time to serialize properties into /tmp/LTL5858129232711784593.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL432435842447693521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5858129232711784593.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((F(G("(p126<1)"))))
Formula 0 simplified : GF!"(p126<1)"
Detected timeout of ITS tools.
[2023-03-10 18:25:33] [INFO ] Flatten gal took : 7 ms
[2023-03-10 18:25:33] [INFO ] Applying decomposition
[2023-03-10 18:25:33] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1360864316947945153.txt' '-o' '/tmp/graph1360864316947945153.bin' '-w' '/tmp/graph1360864316947945153.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1360864316947945153.bin' '-l' '-1' '-v' '-w' '/tmp/graph1360864316947945153.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:25:33] [INFO ] Decomposing Gal with order
[2023-03-10 18:25:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:25:33] [INFO ] Removed a total of 64 redundant transitions.
[2023-03-10 18:25:33] [INFO ] Flatten gal took : 19 ms
[2023-03-10 18:25:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2023-03-10 18:25:33] [INFO ] Time to serialize gal into /tmp/LTL1736925113287882349.gal : 4 ms
[2023-03-10 18:25:33] [INFO ] Time to serialize properties into /tmp/LTL486511838421110847.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1736925113287882349.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL486511838421110847.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G("(i0.u5.p126<1)"))))
Formula 0 simplified : GF!"(i0.u5.p126<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15085007931863514545
[2023-03-10 18:25:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15085007931863514545
Running compilation step : cd /tmp/ltsmin15085007931863514545;'/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 276 ms.
Running link step : cd /tmp/ltsmin15085007931863514545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin15085007931863514545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 93467 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)))&&X(F(p2))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2023-03-10 18:26:03] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-10 18:26:03] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-10 18:26:03] [INFO ] Invariant cache hit.
[2023-03-10 18:26:04] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-10 18:26:04] [INFO ] Invariant cache hit.
[2023-03-10 18:26:04] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s59 1) (GEQ s161 1)), p1:(LT s148 1), p2:(AND (LT s148 1) (OR (LT s59 1) (LT s161 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 886 steps with 57 reset in 2 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 903 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(((G(p2)||p1)&&p0))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 151
Reduce places removed 44 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 163 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 161 transition count 149
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 93 place count 161 transition count 141
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 109 place count 153 transition count 141
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 185 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 110 transition count 103
Applied a total of 195 rules in 18 ms. Remains 110 /209 variables (removed 99) and now considering 103/197 (removed 94) transitions.
// Phase 1: matrix 103 rows 110 cols
[2023-03-10 18:26:04] [INFO ] Computed 19 place invariants in 3 ms
[2023-03-10 18:26:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-10 18:26:04] [INFO ] Invariant cache hit.
[2023-03-10 18:26:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:26:04] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2023-03-10 18:26:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:26:04] [INFO ] Invariant cache hit.
[2023-03-10 18:26:04] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/209 places, 103/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 488 ms. Remains : 110/209 places, 103/197 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s109 1)), p0:(AND (GEQ s65 1) (OR (LT s0 1) (LT s38 1))), p2:(OR (LT s0 1) (LT s38 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 10 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 596 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 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 159 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
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 115 place count 150 transition count 138
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 193 place count 111 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
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 205 place count 105 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 206 place count 104 transition count 98
Applied a total of 206 rules in 20 ms. Remains 104 /209 variables (removed 105) and now considering 98/197 (removed 99) transitions.
// Phase 1: matrix 98 rows 104 cols
[2023-03-10 18:26:04] [INFO ] Computed 19 place invariants in 8 ms
[2023-03-10 18:26:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 18:26:05] [INFO ] Invariant cache hit.
[2023-03-10 18:26:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:26:05] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-10 18:26:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:26:05] [INFO ] Invariant cache hit.
[2023-03-10 18:26:05] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/209 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 458 ms. Remains : 104/209 places, 98/197 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s87 1) (GEQ s101 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 19 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 507 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(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 208 transition count 146
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 150 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 189 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 108 transition count 102
Applied a total of 201 rules in 14 ms. Remains 108 /209 variables (removed 101) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 108 cols
[2023-03-10 18:26:05] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-10 18:26:05] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-10 18:26:05] [INFO ] Invariant cache hit.
[2023-03-10 18:26:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 18:26:05] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-10 18:26:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:26:05] [INFO ] Invariant cache hit.
[2023-03-10 18:26:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 496 ms. Remains : 108/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s17 1) (LT s54 1)), p0:(LT s17 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8822 reset in 119 ms.
Product exploration explored 100000 steps with 8874 reset in 132 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/108 stabilizing places and 1/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 901 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 628 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:26:06] [INFO ] Invariant cache hit.
[2023-03-10 18:26:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:26:06] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-10 18:26:07] [INFO ] After 56ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 18:26:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 18:26:07] [INFO ] After 47ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:26:07] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:26:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:26:07] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:26:07] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:26:07] [INFO ] After 41ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 18:26:07] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 18:26:07] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 14 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1286 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 10 ms. (steps per millisecond=194 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 11 ms. (steps per millisecond=176 ) properties seen :1
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-10 18:26:08] [INFO ] Invariant cache hit.
[2023-03-10 18:26:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 18:26:08] [INFO ] Invariant cache hit.
[2023-03-10 18:26:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 18:26:08] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2023-03-10 18:26:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:26:08] [INFO ] Invariant cache hit.
[2023-03-10 18:26:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 108/108 places, 102/102 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 882 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 607 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 18:26:08] [INFO ] Invariant cache hit.
[2023-03-10 18:26:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:26:08] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:26:08] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-10 18:26:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 18:26:09] [INFO ] After 46ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:26:09] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 18:26:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:26:09] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-10 18:26:09] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 18:26:09] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 18:26:09] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-10 18:26:09] [INFO ] After 153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 17 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 871 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 13 ms. (steps per millisecond=149 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 13 ms. (steps per millisecond=149 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8813 reset in 108 ms.
Product exploration explored 100000 steps with 8845 reset in 125 ms.
Built C files in :
/tmp/ltsmin9623483791880158503
[2023-03-10 18:26:10] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-10 18:26:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:10] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-10 18:26:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:10] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-10 18:26:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:10] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9623483791880158503
Running compilation step : cd /tmp/ltsmin9623483791880158503;'/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/ltsmin9623483791880158503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9623483791880158503;'/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/stateBased17808314803717742655.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 107 cols
[2023-03-10 18:26:25] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-10 18:26:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 18:26:25] [INFO ] Invariant cache hit.
[2023-03-10 18:26:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:26:25] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-10 18:26:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:26:25] [INFO ] Invariant cache hit.
[2023-03-10 18:26:25] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 107/108 places, 101/102 transitions.
Built C files in :
/tmp/ltsmin665184923268802116
[2023-03-10 18:26:25] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2023-03-10 18:26:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:25] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2023-03-10 18:26:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:25] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2023-03-10 18:26:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:26:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin665184923268802116
Running compilation step : cd /tmp/ltsmin665184923268802116;'/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 312 ms.
Running link step : cd /tmp/ltsmin665184923268802116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin665184923268802116;'/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/stateBased206194749325356762.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 18:26:40] [INFO ] Flatten gal took : 9 ms
[2023-03-10 18:26:40] [INFO ] Flatten gal took : 5 ms
[2023-03-10 18:26:40] [INFO ] Time to serialize gal into /tmp/LTL9183460293443270986.gal : 1 ms
[2023-03-10 18:26:40] [INFO ] Time to serialize properties into /tmp/LTL6202057356166105219.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9183460293443270986.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3191311219760705155.hoa' '-atoms' '/tmp/LTL6202057356166105219.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL6202057356166105219.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3191311219760705155.hoa
Detected timeout of ITS tools.
[2023-03-10 18:26:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:26:55] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:26:55] [INFO ] Time to serialize gal into /tmp/LTL2597750267615878541.gal : 2 ms
[2023-03-10 18:26:55] [INFO ] Time to serialize properties into /tmp/LTL9510319873285939950.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2597750267615878541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9510319873285939950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p120<1)")U(("((p120<1)&&(p19<1))")||(G("(p120<1)"))))))&&(("(p1>=1)")||(X(F(("(p1>=1)")&&(F("(p120>=1)")))))))))
Formula 0 simplified : FG(!"(p120<1)" M !"((p120<1)&&(p19<1))") | G(!"(p1>=1)" & XG(!"(p1>=1)" | G!"(p120>=1)"))
Detected timeout of ITS tools.
[2023-03-10 18:27:10] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:27:10] [INFO ] Applying decomposition
[2023-03-10 18:27:10] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11252691706759181756.txt' '-o' '/tmp/graph11252691706759181756.bin' '-w' '/tmp/graph11252691706759181756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11252691706759181756.bin' '-l' '-1' '-v' '-w' '/tmp/graph11252691706759181756.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:27:10] [INFO ] Decomposing Gal with order
[2023-03-10 18:27:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:27:10] [INFO ] Removed a total of 64 redundant transitions.
[2023-03-10 18:27:10] [INFO ] Flatten gal took : 14 ms
[2023-03-10 18:27:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2023-03-10 18:27:10] [INFO ] Time to serialize gal into /tmp/LTL13932371504409051476.gal : 3 ms
[2023-03-10 18:27:10] [INFO ] Time to serialize properties into /tmp/LTL3654116554355097909.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13932371504409051476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3654116554355097909.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i0.u4.p120<1)")U(("((i0.u4.p120<1)&&(i1.u27.p19<1))")||(G("(i0.u4.p120<1)"))))))&&(("(i1.u31.p1>=1)")||(X(F(("(i1.u31.p1>...191
Formula 0 simplified : FG(!"(i0.u4.p120<1)" M !"((i0.u4.p120<1)&&(i1.u27.p19<1))") | G(!"(i1.u31.p1>=1)" & XG(!"(i1.u31.p1>=1)" | G!"(i0.u4.p120>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5623154562465626484
[2023-03-10 18:27:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5623154562465626484
Running compilation step : cd /tmp/ltsmin5623154562465626484;'/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 290 ms.
Running link step : cd /tmp/ltsmin5623154562465626484;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5623154562465626484;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))&&((LTLAPp2==true)||X(<>(((LTLAPp2==true)&&<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 95621 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)))&&G((p2&&F(p3)))))'
Support contains 6 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 95 place count 161 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
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 113 place count 151 transition count 139
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 185 place count 115 transition count 103
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 110 transition count 103
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 109 transition count 102
Applied a total of 197 rules in 26 ms. Remains 109 /209 variables (removed 100) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 109 cols
[2023-03-10 18:27:41] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-10 18:27:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-10 18:27:41] [INFO ] Invariant cache hit.
[2023-03-10 18:27:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:27:41] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-10 18:27:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:27:41] [INFO ] Invariant cache hit.
[2023-03-10 18:27:41] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 109/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LT s55 1), p0:(AND (GEQ s38 1) (GEQ s106 1)), p3:(LT s67 1), p1:(OR (LT s52 1) (LT s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 11376 reset in 143 ms.
Product exploration explored 100000 steps with 11401 reset in 155 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 109 vertex of which 108 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 p2 (NOT p0) p3 p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X p3), (X p2), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 518 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter insensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 979 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 663 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 664 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 637 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 18:27:43] [INFO ] Invariant cache hit.
[2023-03-10 18:27:43] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:43] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:27:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 18:27:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:43] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-10 18:27:43] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 18:27:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:27:43] [INFO ] After 42ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 18:27:43] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-10 18:27:43] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 37 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 100
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 106 transition count 91
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 24 place count 97 transition count 91
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 97 transition count 91
Applied a total of 39 rules in 9 ms. Remains 97 /109 variables (removed 12) and now considering 91/102 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 97/109 places, 91/102 transitions.
Incomplete random walk after 10000 steps, including 1236 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 832 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 847 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 395156 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{0=1}
Probabilistic random walk after 395156 steps, saw 197692 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 97 cols
[2023-03-10 18:27:47] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-10 18:27:47] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:47] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:27:47] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:27:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:47] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:27:47] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:47] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:47] [INFO ] After 29ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:47] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 18:27:47] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 1260 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 416991 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 416991 steps, saw 208627 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 18:27:50] [INFO ] Invariant cache hit.
[2023-03-10 18:27:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:50] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:27:50] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:27:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:50] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:27:50] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:50] [INFO ] After 30ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:50] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 18:27:50] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-10 18:27:50] [INFO ] Invariant cache hit.
[2023-03-10 18:27:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-10 18:27:51] [INFO ] Invariant cache hit.
[2023-03-10 18:27:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:51] [INFO ] Implicit Places using invariants and state equation in 326 ms returned [22, 28, 64, 69, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 416 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/97 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 90
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 91 transition count 90
Applied a total of 5 rules in 7 ms. Remains 91 /92 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 91 cols
[2023-03-10 18:27:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 18:27:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-10 18:27:51] [INFO ] Invariant cache hit.
[2023-03-10 18:27:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:51] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/97 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 812 ms. Remains : 91/97 places, 90/91 transitions.
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 368175 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :{}
Probabilistic random walk after 368175 steps, saw 184129 distinct states, run finished after 3001 ms. (steps per millisecond=122 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 18:27:55] [INFO ] Invariant cache hit.
[2023-03-10 18:27:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:55] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 18:27:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:27:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:55] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 18:27:55] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:55] [INFO ] After 27ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:55] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 18:27:55] [INFO ] After 169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-10 18:27:55] [INFO ] Invariant cache hit.
[2023-03-10 18:27:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 18:27:55] [INFO ] Invariant cache hit.
[2023-03-10 18:27:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:27:55] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-10 18:27:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:27:55] [INFO ] Invariant cache hit.
[2023-03-10 18:27:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 91/91 places, 90/90 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 82 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 82 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 81 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 79
Applied a total of 22 rules in 10 ms. Remains 80 /91 variables (removed 11) and now considering 79/90 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 79 rows 80 cols
[2023-03-10 18:27:55] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 18:27:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:55] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 18:27:55] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:27:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:55] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-10 18:27:56] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 18:27:56] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:27:56] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-10 18:27:56] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 (NOT p0) p3 p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X p3), (X p2), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X p2))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT p3))]
Knowledge based reduction with 12 factoid took 587 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 109 cols
[2023-03-10 18:27:57] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-10 18:27:57] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 18:27:57] [INFO ] Invariant cache hit.
[2023-03-10 18:27:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:27:57] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-10 18:27:57] [INFO ] Invariant cache hit.
[2023-03-10 18:27:57] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 109/109 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 109 vertex of which 108 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X p2), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 458 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Incomplete random walk after 10000 steps, including 968 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 635 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 638 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 635 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 18:27:58] [INFO ] Invariant cache hit.
[2023-03-10 18:27:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:58] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:27:58] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 18:27:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:27:58] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:27:58] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 18:27:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:27:58] [INFO ] After 43ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-10 18:27:58] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-10 18:27:58] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 102/102 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 106 transition count 100
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 15 place count 106 transition count 91
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 24 place count 97 transition count 91
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 1 with 15 rules applied. Total rules applied 39 place count 97 transition count 91
Applied a total of 39 rules in 8 ms. Remains 97 /109 variables (removed 12) and now considering 91/102 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 97/109 places, 91/102 transitions.
Incomplete random walk after 10000 steps, including 1238 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 826 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 860 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 411137 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{0=1}
Probabilistic random walk after 411137 steps, saw 205689 distinct states, run finished after 3006 ms. (steps per millisecond=136 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 91 rows 97 cols
[2023-03-10 18:28:02] [INFO ] Computed 19 place invariants in 4 ms
[2023-03-10 18:28:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:28:02] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:28:02] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:28:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:28:02] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:28:02] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:02] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:02] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 18:28:02] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 91/91 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 855 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 429584 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 429584 steps, saw 214914 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 18:28:05] [INFO ] Invariant cache hit.
[2023-03-10 18:28:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:28:05] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 18:28:05] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:28:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:28:05] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 18:28:05] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:05] [INFO ] After 32ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:05] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 18:28:05] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 97/97 places, 91/91 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 91/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-10 18:28:05] [INFO ] Invariant cache hit.
[2023-03-10 18:28:05] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 18:28:05] [INFO ] Invariant cache hit.
[2023-03-10 18:28:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:06] [INFO ] Implicit Places using invariants and state equation in 319 ms returned [22, 28, 64, 69, 87]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 429 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/97 places, 91/91 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 90
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 91 transition count 90
Applied a total of 5 rules in 6 ms. Remains 91 /92 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 91 cols
[2023-03-10 18:28:06] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 18:28:06] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 18:28:06] [INFO ] Invariant cache hit.
[2023-03-10 18:28:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:06] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/97 places, 90/91 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 799 ms. Remains : 91/97 places, 90/91 transitions.
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 899 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 450677 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 450677 steps, saw 225392 distinct states, run finished after 3003 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-10 18:28:09] [INFO ] Invariant cache hit.
[2023-03-10 18:28:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:28:09] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-10 18:28:09] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:28:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:28:09] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 18:28:10] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:10] [INFO ] After 27ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:10] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-10 18:28:10] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 91/91 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-10 18:28:10] [INFO ] Invariant cache hit.
[2023-03-10 18:28:10] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-10 18:28:10] [INFO ] Invariant cache hit.
[2023-03-10 18:28:10] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-10 18:28:10] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-10 18:28:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 18:28:10] [INFO ] Invariant cache hit.
[2023-03-10 18:28:10] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 ms. Remains : 91/91 places, 90/90 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 82 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 82 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 81 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 79
Applied a total of 22 rules in 10 ms. Remains 80 /91 variables (removed 11) and now considering 79/90 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 79 rows 80 cols
[2023-03-10 18:28:10] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-10 18:28:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 18:28:10] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 18:28:10] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 18:28:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 18:28:10] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-10 18:28:10] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 18:28:10] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-10 18:28:10] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-10 18:28:10] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) p1 p3 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), (X p2), (X (X (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p3)), (X (X p2))]
False Knowledge obtained : [(F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) p1))), (F (NOT p3))]
Knowledge based reduction with 11 factoid took 540 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 11443 reset in 137 ms.
Product exploration explored 100000 steps with 11321 reset in 147 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1)), (NOT p3), (OR (NOT p3) (NOT p2))]
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 13 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-10 18:28:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 102 rows 109 cols
[2023-03-10 18:28:12] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-10 18:28:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 109/109 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin13779756504525663954
[2023-03-10 18:28:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13779756504525663954
Running compilation step : cd /tmp/ltsmin13779756504525663954;'/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 306 ms.
Running link step : cd /tmp/ltsmin13779756504525663954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13779756504525663954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4210080210719350568.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-10 18:28:27] [INFO ] Invariant cache hit.
[2023-03-10 18:28:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-10 18:28:28] [INFO ] Invariant cache hit.
[2023-03-10 18:28:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-10 18:28:28] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-10 18:28:28] [INFO ] Invariant cache hit.
[2023-03-10 18:28:28] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 109/109 places, 102/102 transitions.
Built C files in :
/tmp/ltsmin1498685561511103937
[2023-03-10 18:28:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1498685561511103937
Running compilation step : cd /tmp/ltsmin1498685561511103937;'/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 278 ms.
Running link step : cd /tmp/ltsmin1498685561511103937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1498685561511103937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7058250539308060436.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 18:28:43] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:28:43] [INFO ] Flatten gal took : 5 ms
[2023-03-10 18:28:43] [INFO ] Time to serialize gal into /tmp/LTL14087959501833006905.gal : 2 ms
[2023-03-10 18:28:43] [INFO ] Time to serialize properties into /tmp/LTL12290623699130356675.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14087959501833006905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4405769549194618770.hoa' '-atoms' '/tmp/LTL12290623699130356675.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12290623699130356675.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4405769549194618770.hoa
Detected timeout of ITS tools.
[2023-03-10 18:28:58] [INFO ] Flatten gal took : 5 ms
[2023-03-10 18:28:58] [INFO ] Flatten gal took : 5 ms
[2023-03-10 18:28:58] [INFO ] Time to serialize gal into /tmp/LTL13652665275911669203.gal : 2 ms
[2023-03-10 18:28:58] [INFO ] Time to serialize properties into /tmp/LTL12253215739848488334.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13652665275911669203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12253215739848488334.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F(("((p159>=1)&&(p96>=1))")||(G("((p189<1)||(p213<1))"))))&&(G(("(p198<1)")&&(F("(p26<1)"))))))
Formula 0 simplified : G(!"((p159>=1)&&(p96>=1))" & F!"((p189<1)||(p213<1))") | F(!"(p198<1)" | G!"(p26<1)")
Detected timeout of ITS tools.
[2023-03-10 18:29:13] [INFO ] Flatten gal took : 6 ms
[2023-03-10 18:29:13] [INFO ] Applying decomposition
[2023-03-10 18:29:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12354114588078763600.txt' '-o' '/tmp/graph12354114588078763600.bin' '-w' '/tmp/graph12354114588078763600.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12354114588078763600.bin' '-l' '-1' '-v' '-w' '/tmp/graph12354114588078763600.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:29:13] [INFO ] Decomposing Gal with order
[2023-03-10 18:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:29:13] [INFO ] Removed a total of 63 redundant transitions.
[2023-03-10 18:29:13] [INFO ] Flatten gal took : 12 ms
[2023-03-10 18:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2023-03-10 18:29:13] [INFO ] Time to serialize gal into /tmp/LTL650567672436445780.gal : 3 ms
[2023-03-10 18:29:13] [INFO ] Time to serialize properties into /tmp/LTL5799874506188952819.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL650567672436445780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5799874506188952819.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((F(("((i6.u13.p159>=1)&&(i1.u38.p96>=1))")||(G("((i2.u18.p189<1)||(i2.u21.p213<1))"))))&&(G(("(i2.u19.p198<1)")&&(F("(i0.u23.p26<1)...162
Formula 0 simplified : G(!"((i6.u13.p159>=1)&&(i1.u38.p96>=1))" & F!"((i2.u18.p189<1)||(i2.u21.p213<1))") | F(!"(i2.u19.p198<1)" | G!"(i0.u23.p26<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16078076843181655554
[2023-03-10 18:29:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16078076843181655554
Running compilation step : cd /tmp/ltsmin16078076843181655554;'/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 286 ms.
Running link step : cd /tmp/ltsmin16078076843181655554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16078076843181655554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))&&[](((LTLAPp2==true)&&<>((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 122738 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)))'
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(F(p1))))))'
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)))'
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(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
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)))&&G((p2&&F(p3)))))'
[2023-03-10 18:29:44] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17180572750499987825
[2023-03-10 18:29:44] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2023-03-10 18:29:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:29:44] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2023-03-10 18:29:44] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:29:44] [INFO ] Applying decomposition
[2023-03-10 18:29:44] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2023-03-10 18:29:44] [INFO ] Flatten gal took : 7 ms
[2023-03-10 18:29:44] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 18:29:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17180572750499987825
Running compilation step : cd /tmp/ltsmin17180572750499987825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '144' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5519770316398965645.txt' '-o' '/tmp/graph5519770316398965645.bin' '-w' '/tmp/graph5519770316398965645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5519770316398965645.bin' '-l' '-1' '-v' '-w' '/tmp/graph5519770316398965645.weights' '-q' '0' '-e' '0.001'
[2023-03-10 18:29:44] [INFO ] Decomposing Gal with order
[2023-03-10 18:29:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 18:29:44] [INFO ] Removed a total of 52 redundant transitions.
[2023-03-10 18:29:44] [INFO ] Flatten gal took : 20 ms
[2023-03-10 18:29:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2023-03-10 18:29:44] [INFO ] Time to serialize gal into /tmp/LTLFireability10470486632125663002.gal : 4 ms
[2023-03-10 18:29:44] [INFO ] Time to serialize properties into /tmp/LTLFireability16373629945261347197.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10470486632125663002.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16373629945261347197.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 5 LTL properties
Checking formula 0 : !((G(F("((i4.i3.u43.p198<1)&&(i6.i1.u85.p98<1))"))))
Formula 0 simplified : FG!"((i4.i3.u43.p198<1)&&(i6.i1.u85.p98<1))"
Compilation finished in 572 ms.
Running link step : cd /tmp/ltsmin17180572750499987825;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '[](<>(((LTLAPp1==true)||[](<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-10 18:52:42] [INFO ] Flatten gal took : 7 ms
[2023-03-10 18:52:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13016637157536469319.gal : 9 ms
[2023-03-10 18:52:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16723350891685815435.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13016637157536469319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16723350891685815435.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 5 LTL properties
Checking formula 0 : !((G(F("((p198<1)&&(p98<1))"))))
Formula 0 simplified : FG!"((p198<1)&&(p98<1))"
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '[](<>(((LTLAPp1==true)||[](<>((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true))))))&&((LTLAPp6==true)||X(<>(((LTLAPp6==true)&&<>(!(LTLAPp4==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-10 19:15:41] [INFO ] Flatten gal took : 7 ms
[2023-03-10 19:15:41] [INFO ] Input system was already deterministic with 197 transitions.
[2023-03-10 19:15:41] [INFO ] Transformed 209 places.
[2023-03-10 19:15:41] [INFO ] Transformed 197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-10 19:15:41] [INFO ] Time to serialize gal into /tmp/LTLFireability16745675980582500043.gal : 2 ms
[2023-03-10 19:15:41] [INFO ] Time to serialize properties into /tmp/LTLFireability9930814630264858343.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16745675980582500043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9930814630264858343.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p198<1)&&(p98<1))"))))
Formula 0 simplified : FG!"((p198<1)&&(p98<1))"
WARNING : LTSmin timed out (>720 s) on command cd /tmp/ltsmin17180572750499987825;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>(((LTLAPp4==true) U ((LTLAPp5==true)||[]((LTLAPp4==true))))))&&((LTLAPp6==true)||X(<>(((LTLAPp6==true)&&<>(!(LTLAPp4==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '(<>(((LTLAPp7==true)||[]((LTLAPp8==true))))&&[](((LTLAPp9==true)&&<>((LTLAPp10==true)))))' '--buchi-type=spotba'
LTSmin run took 92274 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 5760 s
Running LTSmin : cd /tmp/ltsmin17180572750499987825;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11891012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034808 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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-004"
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-004, 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-167819411100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-004.tgz
mv DoubleExponent-PT-004 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 ;