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.r517-tall-167987243300052.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 Anderson-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.3M Mar 31 16:48 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 Anderson-PT-10-LTLFireability-00
FORMULA_NAME Anderson-PT-10-LTLFireability-01
FORMULA_NAME Anderson-PT-10-LTLFireability-02
FORMULA_NAME Anderson-PT-10-LTLFireability-03
FORMULA_NAME Anderson-PT-10-LTLFireability-04
FORMULA_NAME Anderson-PT-10-LTLFireability-05
FORMULA_NAME Anderson-PT-10-LTLFireability-06
FORMULA_NAME Anderson-PT-10-LTLFireability-07
FORMULA_NAME Anderson-PT-10-LTLFireability-08
FORMULA_NAME Anderson-PT-10-LTLFireability-09
FORMULA_NAME Anderson-PT-10-LTLFireability-10
FORMULA_NAME Anderson-PT-10-LTLFireability-11
FORMULA_NAME Anderson-PT-10-LTLFireability-12
FORMULA_NAME Anderson-PT-10-LTLFireability-13
FORMULA_NAME Anderson-PT-10-LTLFireability-14
FORMULA_NAME Anderson-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680846772886

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=Anderson-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 05:52:54] [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-04-07 05:52:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:52:54] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-04-07 05:52:54] [INFO ] Transformed 621 places.
[2023-04-07 05:52:54] [INFO ] Transformed 2480 transitions.
[2023-04-07 05:52:54] [INFO ] Found NUPN structural information;
[2023-04-07 05:52:54] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Anderson-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 621 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Discarding 163 places :
Symmetric choice reduction at 0 with 163 rule applications. Total rules 163 place count 458 transition count 1003
Iterating global reduction 0 with 163 rules applied. Total rules applied 326 place count 458 transition count 1003
Applied a total of 326 rules in 87 ms. Remains 458 /621 variables (removed 163) and now considering 1003/2480 (removed 1477) transitions.
// Phase 1: matrix 1003 rows 458 cols
[2023-04-07 05:52:54] [INFO ] Computed 23 invariants in 47 ms
[2023-04-07 05:52:55] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-04-07 05:52:55] [INFO ] Invariant cache hit.
[2023-04-07 05:52:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:52:56] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 2101 ms to find 0 implicit places.
[2023-04-07 05:52:56] [INFO ] Invariant cache hit.
[2023-04-07 05:52:57] [INFO ] Dead Transitions using invariants and state equation in 591 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 458/621 places, 1003/2480 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2782 ms. Remains : 458/621 places, 1003/2480 transitions.
Support contains 37 out of 458 places after structural reductions.
[2023-04-07 05:52:57] [INFO ] Flatten gal took : 100 ms
[2023-04-07 05:52:57] [INFO ] Flatten gal took : 64 ms
[2023-04-07 05:52:57] [INFO ] Input system was already deterministic with 1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=17 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :1
Running SMT prover for 13 properties.
[2023-04-07 05:52:58] [INFO ] Invariant cache hit.
[2023-04-07 05:52:58] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-04-07 05:52:58] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 24 ms returned sat
[2023-04-07 05:53:00] [INFO ] After 1353ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-04-07 05:53:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-04-07 05:53:00] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 05:53:02] [INFO ] After 1865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-04-07 05:53:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:03] [INFO ] After 1303ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-04-07 05:53:04] [INFO ] After 2794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 1576 ms.
[2023-04-07 05:53:06] [INFO ] After 6563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Parikh walk visited 0 properties in 46 ms.
Support contains 25 out of 458 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 365 transition count 856
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 365 transition count 856
Applied a total of 186 rules in 79 ms. Remains 365 /458 variables (removed 93) and now considering 856/1003 (removed 147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 365/458 places, 856/1003 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 856 rows 365 cols
[2023-04-07 05:53:07] [INFO ] Computed 23 invariants in 12 ms
[2023-04-07 05:53:07] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 05:53:07] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 05:53:07] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-07 05:53:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 05:53:08] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 05:53:08] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-07 05:53:08] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:09] [INFO ] After 465ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-07 05:53:09] [INFO ] After 1016ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 398 ms.
[2023-04-07 05:53:10] [INFO ] After 2239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 52 ms.
Support contains 13 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 856/856 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 359 transition count 742
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 359 transition count 742
Applied a total of 12 rules in 39 ms. Remains 359 /365 variables (removed 6) and now considering 742/856 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 359/365 places, 742/856 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 742 rows 359 cols
[2023-04-07 05:53:10] [INFO ] Computed 23 invariants in 13 ms
[2023-04-07 05:53:11] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 05:53:11] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 05:53:11] [INFO ] After 347ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 05:53:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-04-07 05:53:11] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 05:53:12] [INFO ] After 608ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 05:53:12] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:12] [INFO ] After 580ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 05:53:13] [INFO ] After 944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-04-07 05:53:13] [INFO ] After 1972ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 9 ms.
Support contains 11 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 742/742 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 358 transition count 723
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 358 transition count 723
Applied a total of 2 rules in 29 ms. Remains 358 /359 variables (removed 1) and now considering 723/742 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 358/359 places, 723/742 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 242300 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242300 steps, saw 179080 distinct states, run finished after 3006 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 723 rows 358 cols
[2023-04-07 05:53:16] [INFO ] Computed 23 invariants in 6 ms
[2023-04-07 05:53:17] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 05:53:17] [INFO ] [Real]Absence check using 12 positive and 11 generalized place invariants in 11 ms returned sat
[2023-04-07 05:53:17] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 05:53:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2023-04-07 05:53:17] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 12 ms returned sat
[2023-04-07 05:53:18] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 05:53:18] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:18] [INFO ] After 461ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 05:53:18] [INFO ] After 890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 343 ms.
[2023-04-07 05:53:19] [INFO ] After 1974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 28 ms.
Support contains 11 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 358/358 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 723/723 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-04-07 05:53:19] [INFO ] Invariant cache hit.
[2023-04-07 05:53:19] [INFO ] Implicit Places using invariants in 359 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 361 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/358 places, 723/723 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 357 transition count 630
Reduce places removed 93 places and 0 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 264 transition count 630
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 264 transition count 623
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 200 place count 257 transition count 623
Applied a total of 200 rules in 30 ms. Remains 257 /357 variables (removed 100) and now considering 623/723 (removed 100) transitions.
// Phase 1: matrix 623 rows 257 cols
[2023-04-07 05:53:19] [INFO ] Computed 22 invariants in 6 ms
[2023-04-07 05:53:19] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-04-07 05:53:19] [INFO ] Invariant cache hit.
[2023-04-07 05:53:20] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:20] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 257/358 places, 623/723 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1275 ms. Remains : 257/358 places, 623/723 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 313921 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{1=1, 2=1, 5=1}
Probabilistic random walk after 313921 steps, saw 225357 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :3
Running SMT prover for 3 properties.
[2023-04-07 05:53:24] [INFO ] Invariant cache hit.
[2023-04-07 05:53:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:24] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:24] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:53:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:24] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-07 05:53:24] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:53:24] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:25] [INFO ] After 170ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:53:25] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-04-07 05:53:25] [INFO ] After 804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 11 ms.
Support contains 7 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 623/623 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 254 transition count 566
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 254 transition count 566
Applied a total of 6 rules in 17 ms. Remains 254 /257 variables (removed 3) and now considering 566/623 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 254/257 places, 566/623 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 371189 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 371189 steps, saw 276511 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 566 rows 254 cols
[2023-04-07 05:53:28] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 05:53:28] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 05:53:28] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-07 05:53:28] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:53:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:29] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:29] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:53:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:29] [INFO ] After 167ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-07 05:53:29] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-04-07 05:53:29] [INFO ] After 793ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 7 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 37 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 254/254 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 566/566 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-04-07 05:53:29] [INFO ] Invariant cache hit.
[2023-04-07 05:53:29] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-04-07 05:53:29] [INFO ] Invariant cache hit.
[2023-04-07 05:53:30] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:30] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
[2023-04-07 05:53:30] [INFO ] Redundant transitions in 30 ms returned []
[2023-04-07 05:53:30] [INFO ] Invariant cache hit.
[2023-04-07 05:53:30] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1132 ms. Remains : 254/254 places, 566/566 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 254 transition count 466
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 154 transition count 466
Applied a total of 200 rules in 11 ms. Remains 154 /254 variables (removed 100) and now considering 466/566 (removed 100) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 466 rows 154 cols
[2023-04-07 05:53:30] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:53:30] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:30] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 9 ms returned sat
[2023-04-07 05:53:31] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 05:53:31] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:31] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 05:53:31] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-07 05:53:31] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-04-07 05:53:31] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Anderson-PT-10-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 48 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 05:53:31] [INFO ] Computed 23 invariants in 8 ms
[2023-04-07 05:53:32] [INFO ] Implicit Places using invariants in 453 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 14 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 05:53:32] [INFO ] Computed 22 invariants in 15 ms
[2023-04-07 05:53:32] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-04-07 05:53:32] [INFO ] Invariant cache hit.
[2023-04-07 05:53:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:33] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1500 ms. Remains : 254/458 places, 530/1003 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s32 1)), p0:(AND (EQ s22 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 339 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 5 ms.
FORMULA Anderson-PT-10-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-02 finished in 2292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 194 place count 354 transition count 647
Iterating global reduction 0 with 14 rules applied. Total rules applied 208 place count 354 transition count 647
Applied a total of 208 rules in 25 ms. Remains 354 /458 variables (removed 104) and now considering 647/1003 (removed 356) transitions.
// Phase 1: matrix 647 rows 354 cols
[2023-04-07 05:53:34] [INFO ] Computed 23 invariants in 7 ms
[2023-04-07 05:53:34] [INFO ] Implicit Places using invariants in 399 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 400 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/458 places, 647/1003 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 353 transition count 550
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 256 transition count 550
Applied a total of 194 rules in 10 ms. Remains 256 /353 variables (removed 97) and now considering 550/647 (removed 97) transitions.
// Phase 1: matrix 550 rows 256 cols
[2023-04-07 05:53:34] [INFO ] Computed 22 invariants in 4 ms
[2023-04-07 05:53:34] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-04-07 05:53:34] [INFO ] Invariant cache hit.
[2023-04-07 05:53:34] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:35] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 256/458 places, 550/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1402 ms. Remains : 256/458 places, 550/1003 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s38 1)), p1:(OR (NEQ s15 1) (NEQ s37 1) (AND (EQ s24 1) (EQ s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 124 steps with 0 reset with depth 125 and stack size 125 in 1 ms.
FORMULA Anderson-PT-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-04 finished in 1732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 11 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 05:53:35] [INFO ] Computed 23 invariants in 10 ms
[2023-04-07 05:53:36] [INFO ] Implicit Places using invariants in 419 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 421 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 438 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s39 0)), p1:(OR (EQ s27 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 162 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2682 steps, run visited all 1 properties in 9 ms. (steps per millisecond=298 )
Probabilistic random walk after 2682 steps, saw 2336 distinct states, run finished after 9 ms. (steps per millisecond=298 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-10-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-10-LTLFireability-05 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U !p1) U X((p2||X(p0)))))'
Support contains 5 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 15 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 05:53:37] [INFO ] Computed 23 invariants in 3 ms
[2023-04-07 05:53:37] [INFO ] Implicit Places using invariants in 335 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 373 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p0)), p0, p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 4}], [{ cond=(NOT p0), acceptance={} source=9 dest: 11}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 12}], [{ cond=p0, acceptance={} source=11 dest: 5}, { cond=(NOT p0), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p0), acceptance={0} source=12 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 11}, { cond=(AND p1 (NOT p0)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s39 1)), p0:(AND (EQ s27 1) (EQ s33 1)), p2:(AND (EQ s12 1) (EQ s33 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-07 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 195 place count 353 transition count 628
Iterating global reduction 0 with 15 rules applied. Total rules applied 210 place count 353 transition count 628
Applied a total of 210 rules in 23 ms. Remains 353 /458 variables (removed 105) and now considering 628/1003 (removed 375) transitions.
// Phase 1: matrix 628 rows 353 cols
[2023-04-07 05:53:38] [INFO ] Computed 23 invariants in 3 ms
[2023-04-07 05:53:38] [INFO ] Implicit Places using invariants in 449 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 460 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 352/458 places, 628/1003 transitions.
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 352 transition count 530
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 254 transition count 530
Applied a total of 196 rules in 11 ms. Remains 254 /352 variables (removed 98) and now considering 530/628 (removed 98) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 05:53:38] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:53:38] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-04-07 05:53:38] [INFO ] Invariant cache hit.
[2023-04-07 05:53:39] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:39] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 254/458 places, 530/1003 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1369 ms. Remains : 254/458 places, 530/1003 transitions.
Stuttering acceptance computed with spot in 133 ms :[p0, true, (AND p0 p1), p1]
Running random walk in product with property : Anderson-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NOT (AND (EQ s18 1) (EQ s36 1))) (EQ s28 1) (EQ s41 1)), p1:(AND (EQ s26 1) (EQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 266 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 05:53:40] [INFO ] Invariant cache hit.
[2023-04-07 05:53:40] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:40] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:40] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:40] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 05:53:40] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 05:53:40] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:40] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:41] [INFO ] After 85ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:41] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 05:53:41] [INFO ] After 389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 16 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1101739 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :{}
Probabilistic random walk after 1101739 steps, saw 788052 distinct states, run finished after 3002 ms. (steps per millisecond=367 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 05:53:44] [INFO ] Computed 22 invariants in 8 ms
[2023-04-07 05:53:44] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:44] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:44] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:44] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:44] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:44] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:44] [INFO ] After 73ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:44] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 05:53:44] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 19 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 8 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 05:53:44] [INFO ] Invariant cache hit.
[2023-04-07 05:53:45] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-04-07 05:53:45] [INFO ] Invariant cache hit.
[2023-04-07 05:53:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:45] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2023-04-07 05:53:45] [INFO ] Redundant transitions in 3 ms returned []
[2023-04-07 05:53:45] [INFO ] Invariant cache hit.
[2023-04-07 05:53:46] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1258 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 8 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 05:53:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:53:46] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-04-07 05:53:46] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 05:53:46] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 05:53:46] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 05:53:46] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:46] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-07 05:53:46] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 63 ms :[(AND p0 p1), p1]
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 05:53:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:53:47] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-04-07 05:53:47] [INFO ] Invariant cache hit.
[2023-04-07 05:53:47] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:47] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-04-07 05:53:47] [INFO ] Redundant transitions in 10 ms returned []
[2023-04-07 05:53:47] [INFO ] Invariant cache hit.
[2023-04-07 05:53:48] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1261 ms. Remains : 254/254 places, 530/530 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND p0 p1), p1]
Incomplete random walk after 10000 steps, including 2 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 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 05:53:48] [INFO ] Invariant cache hit.
[2023-04-07 05:53:48] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:48] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 05:53:48] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 05:53:48] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-07 05:53:48] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:48] [INFO ] After 85ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:48] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-07 05:53:48] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 530/530 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 254 transition count 528
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 252 transition count 528
Applied a total of 4 rules in 12 ms. Remains 252 /254 variables (removed 2) and now considering 528/530 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 252/254 places, 528/530 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1160617 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :{}
Probabilistic random walk after 1160617 steps, saw 828711 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 528 rows 252 cols
[2023-04-07 05:53:51] [INFO ] Computed 22 invariants in 12 ms
[2023-04-07 05:53:51] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-04-07 05:53:52] [INFO ] [Real]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:52] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 05:53:52] [INFO ] [Nat]Absence check using 12 positive and 10 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:52] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:52] [INFO ] After 72ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:52] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-07 05:53:52] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 10 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 252/252 places, 528/528 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Applied a total of 0 rules in 5 ms. Remains 252 /252 variables (removed 0) and now considering 528/528 (removed 0) transitions.
[2023-04-07 05:53:52] [INFO ] Invariant cache hit.
[2023-04-07 05:53:52] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-04-07 05:53:52] [INFO ] Invariant cache hit.
[2023-04-07 05:53:52] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:53:53] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2023-04-07 05:53:53] [INFO ] Redundant transitions in 18 ms returned []
[2023-04-07 05:53:53] [INFO ] Invariant cache hit.
[2023-04-07 05:53:53] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1102 ms. Remains : 252/252 places, 528/528 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 252 transition count 428
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 152 transition count 428
Applied a total of 200 rules in 12 ms. Remains 152 /252 variables (removed 100) and now considering 428/528 (removed 100) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 428 rows 152 cols
[2023-04-07 05:53:53] [INFO ] Computed 22 invariants in 3 ms
[2023-04-07 05:53:53] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 05:53:53] [INFO ] [Real]Absence check using 13 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:53] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 05:53:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 05:53:53] [INFO ] [Nat]Absence check using 13 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 05:53:53] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 05:53:53] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 05:53:54] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 75 ms :[(AND p0 p1), p1]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p1), p1]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 177 ms.
Built C files in :
/tmp/ltsmin12671992284120559935
[2023-04-07 05:53:54] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2023-04-07 05:53:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:53:54] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2023-04-07 05:53:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:53:54] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2023-04-07 05:53:54] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:53:54] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12671992284120559935
Running compilation step : cd /tmp/ltsmin12671992284120559935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1212 ms.
Running link step : cd /tmp/ltsmin12671992284120559935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12671992284120559935;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6563293148005123902.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 530/530 transitions.
Applied a total of 0 rules in 6 ms. Remains 254 /254 variables (removed 0) and now considering 530/530 (removed 0) transitions.
// Phase 1: matrix 530 rows 254 cols
[2023-04-07 05:54:09] [INFO ] Computed 22 invariants in 7 ms
[2023-04-07 05:54:10] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-04-07 05:54:10] [INFO ] Invariant cache hit.
[2023-04-07 05:54:10] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:54:10] [INFO ] Implicit Places using invariants and state equation in 696 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-04-07 05:54:10] [INFO ] Redundant transitions in 13 ms returned []
[2023-04-07 05:54:10] [INFO ] Invariant cache hit.
[2023-04-07 05:54:11] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 ms. Remains : 254/254 places, 530/530 transitions.
Built C files in :
/tmp/ltsmin9217383936927076563
[2023-04-07 05:54:11] [INFO ] Computing symmetric may disable matrix : 530 transitions.
[2023-04-07 05:54:11] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:54:11] [INFO ] Computing symmetric may enable matrix : 530 transitions.
[2023-04-07 05:54:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:54:11] [INFO ] Computing Do-Not-Accords matrix : 530 transitions.
[2023-04-07 05:54:11] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:54:11] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9217383936927076563
Running compilation step : cd /tmp/ltsmin9217383936927076563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1167 ms.
Running link step : cd /tmp/ltsmin9217383936927076563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9217383936927076563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6320340094431083592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 05:54:26] [INFO ] Flatten gal took : 26 ms
[2023-04-07 05:54:26] [INFO ] Flatten gal took : 23 ms
[2023-04-07 05:54:26] [INFO ] Time to serialize gal into /tmp/LTL13092040950413492005.gal : 6 ms
[2023-04-07 05:54:26] [INFO ] Time to serialize properties into /tmp/LTL9433571253805002962.prop : 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13092040950413492005.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16655652980068782820.hoa' '-atoms' '/tmp/LTL9433571253805002962.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9433571253805002962.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16655652980068782820.hoa
Detected timeout of ITS tools.
[2023-04-07 05:54:41] [INFO ] Flatten gal took : 22 ms
[2023-04-07 05:54:41] [INFO ] Flatten gal took : 22 ms
[2023-04-07 05:54:41] [INFO ] Time to serialize gal into /tmp/LTL2059832392317972061.gal : 4 ms
[2023-04-07 05:54:41] [INFO ] Time to serialize properties into /tmp/LTL17141161607179825940.ltl : 3 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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2059832392317972061.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17141161607179825940.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))"))||(F(G("((next_16!=1)||(p1_3_9!=1))")))))
Formula 0 simplified : F!"((((next_8==1)&&(ncs_5_7==1))||(next_18!=1))||(ncs_9_3!=1))" & GF!"((next_16!=1)||(p1_3_9!=1))"
Detected timeout of ITS tools.
[2023-04-07 05:54:56] [INFO ] Flatten gal took : 24 ms
[2023-04-07 05:54:56] [INFO ] Applying decomposition
[2023-04-07 05:54:56] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6216435640746278955.txt' '-o' '/tmp/graph6216435640746278955.bin' '-w' '/tmp/graph6216435640746278955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6216435640746278955.bin' '-l' '-1' '-v' '-w' '/tmp/graph6216435640746278955.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:54:56] [INFO ] Decomposing Gal with order
[2023-04-07 05:54:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:54:56] [INFO ] Removed a total of 948 redundant transitions.
[2023-04-07 05:54:56] [INFO ] Flatten gal took : 82 ms
[2023-04-07 05:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 21 ms.
[2023-04-07 05:54:56] [INFO ] Time to serialize gal into /tmp/LTL11729186049414058666.gal : 7 ms
[2023-04-07 05:54:56] [INFO ] Time to serialize properties into /tmp/LTL1979787224830806829.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11729186049414058666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1979787224830806829.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G("((((i2.i1.u8.next_8==1)&&(i0.u58.ncs_5_7==1))||(i2.i1.u12.next_18!=1))||(i1.i1.u14.ncs_9_3!=1))"))||(F(G("((i2.i0.u11.next_16!=...187
Formula 0 simplified : F!"((((i2.i1.u8.next_8==1)&&(i0.u58.ncs_5_7==1))||(i2.i1.u12.next_18!=1))||(i1.i1.u14.ncs_9_3!=1))" & GF!"((i2.i0.u11.next_16!=1)||(...177
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11560957052509229545
[2023-04-07 05:55:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11560957052509229545
Running compilation step : cd /tmp/ltsmin11560957052509229545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 807 ms.
Running link step : cd /tmp/ltsmin11560957052509229545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11560957052509229545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||(<>([]((LTLAPp1==true)))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-10-LTLFireability-08 finished in 108751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(X(G(p0))) U (p1||F(p2)))))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 444 transition count 737
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 444 transition count 737
Applied a total of 28 rules in 11 ms. Remains 444 /458 variables (removed 14) and now considering 737/1003 (removed 266) transitions.
// Phase 1: matrix 737 rows 444 cols
[2023-04-07 05:55:27] [INFO ] Computed 23 invariants in 9 ms
[2023-04-07 05:55:27] [INFO ] Implicit Places using invariants in 331 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 443/458 places, 737/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 443 /443 variables (removed 0) and now considering 737/737 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 443/458 places, 737/1003 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s36 1)), p2:(AND (EQ s13 1) (EQ s40 1)), p0:(AND (EQ s28 1) (EQ s32 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 127 ms.
Stack based approach found an accepted trace after 80 steps with 1 reset with depth 77 and stack size 77 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-09 finished in 755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 441 transition count 680
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 441 transition count 680
Applied a total of 34 rules in 16 ms. Remains 441 /458 variables (removed 17) and now considering 680/1003 (removed 323) transitions.
// Phase 1: matrix 680 rows 441 cols
[2023-04-07 05:55:27] [INFO ] Computed 23 invariants in 5 ms
[2023-04-07 05:55:28] [INFO ] Implicit Places using invariants in 349 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 351 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 440/458 places, 680/1003 transitions.
Applied a total of 0 rules in 5 ms. Remains 440 /440 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 440/458 places, 680/1003 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s3 1) (EQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-10-LTLFireability-10 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 458 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 458 transition count 913
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 368 transition count 913
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 197 place count 351 transition count 590
Iterating global reduction 0 with 17 rules applied. Total rules applied 214 place count 351 transition count 590
Applied a total of 214 rules in 24 ms. Remains 351 /458 variables (removed 107) and now considering 590/1003 (removed 413) transitions.
// Phase 1: matrix 590 rows 351 cols
[2023-04-07 05:55:28] [INFO ] Computed 23 invariants in 9 ms
[2023-04-07 05:55:28] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 05:55:28] [INFO ] Invariant cache hit.
[2023-04-07 05:55:28] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-04-07 05:55:29] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1341 ms to find 0 implicit places.
[2023-04-07 05:55:29] [INFO ] Redundant transitions in 8 ms returned []
[2023-04-07 05:55:29] [INFO ] Invariant cache hit.
[2023-04-07 05:55:30] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 351/458 places, 590/1003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1774 ms. Remains : 351/458 places, 590/1003 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s257 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 0 reset in 206 ms.
Stack based approach found an accepted trace after 86 steps with 0 reset with depth 87 and stack size 87 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-11 finished in 2038 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&F(p2)))))'
Support contains 6 out of 458 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 458/458 places, 1003/1003 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 443 transition count 718
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 443 transition count 718
Applied a total of 30 rules in 17 ms. Remains 443 /458 variables (removed 15) and now considering 718/1003 (removed 285) transitions.
// Phase 1: matrix 718 rows 443 cols
[2023-04-07 05:55:30] [INFO ] Computed 23 invariants in 4 ms
[2023-04-07 05:55:30] [INFO ] Implicit Places using invariants in 316 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 333 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 442/458 places, 718/1003 transitions.
Applied a total of 0 rules in 6 ms. Remains 442 /442 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 356 ms. Remains : 442/458 places, 718/1003 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Anderson-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s274 1)), p1:(OR (EQ s18 0) (EQ s38 0)), p2:(AND (EQ s13 1) (EQ s35 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 163 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA Anderson-PT-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-10-LTLFireability-14 finished in 730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||(!p0&&F(G(!p1)))))'
[2023-04-07 05:55:31] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1037227273581693236
[2023-04-07 05:55:31] [INFO ] Computing symmetric may disable matrix : 1003 transitions.
[2023-04-07 05:55:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:55:31] [INFO ] Applying decomposition
[2023-04-07 05:55:31] [INFO ] Computing symmetric may enable matrix : 1003 transitions.
[2023-04-07 05:55:31] [INFO ] Computation of Complete enable matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 05:55:31] [INFO ] Flatten gal took : 83 ms
[2023-04-07 05:55:31] [INFO ] Computing Do-Not-Accords matrix : 1003 transitions.
[2023-04-07 05:55:31] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7352762421381298954.txt' '-o' '/tmp/graph7352762421381298954.bin' '-w' '/tmp/graph7352762421381298954.weights'
[2023-04-07 05:55:31] [INFO ] Built C files in 242ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1037227273581693236
Running compilation step : cd /tmp/ltsmin1037227273581693236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7352762421381298954.bin' '-l' '-1' '-v' '-w' '/tmp/graph7352762421381298954.weights' '-q' '0' '-e' '0.001'
[2023-04-07 05:55:31] [INFO ] Decomposing Gal with order
[2023-04-07 05:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 05:55:31] [INFO ] Removed a total of 1858 redundant transitions.
[2023-04-07 05:55:31] [INFO ] Flatten gal took : 200 ms
[2023-04-07 05:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 13 ms.
[2023-04-07 05:55:31] [INFO ] Time to serialize gal into /tmp/LTLFireability2447066443324410023.gal : 7 ms
[2023-04-07 05:55:31] [INFO ] Time to serialize properties into /tmp/LTLFireability7759281800169437995.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2447066443324410023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7759281800169437995.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(!("(((!((i3.u5.next_8==1)&&(i8.u84.ncs_5_7==1)))&&(i7.i0.u9.next_18==1))&&(i10.u46.ncs_9_3==1))")))||(F(G(!("((i7.i0.u8.next_16=...186
Formula 0 simplified : F"(((!((i3.u5.next_8==1)&&(i8.u84.ncs_5_7==1)))&&(i7.i0.u9.next_18==1))&&(i10.u46.ncs_9_3==1))" & GF"((i7.i0.u8.next_16==1)&&(i3.u72...168
Compilation finished in 3065 ms.
Running link step : cd /tmp/ltsmin1037227273581693236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1037227273581693236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-04-07 06:16:24] [INFO ] Applying decomposition
[2023-04-07 06:16:24] [INFO ] Flatten gal took : 93 ms
[2023-04-07 06:16:24] [INFO ] Decomposing Gal with order
[2023-04-07 06:16:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:16:24] [INFO ] Removed a total of 1187 redundant transitions.
[2023-04-07 06:16:25] [INFO ] Flatten gal took : 287 ms
[2023-04-07 06:16:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 298 labels/synchronizations in 48 ms.
[2023-04-07 06:16:25] [INFO ] Time to serialize gal into /tmp/LTLFireability625097258444552034.gal : 5 ms
[2023-04-07 06:16:25] [INFO ] Time to serialize properties into /tmp/LTLFireability10953986985816730954.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability625097258444552034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10953986985816730954.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(!("(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))")))||(F(G(!("((u11.next_16==1)&&(u10.p1_3_9==1))...162
Formula 0 simplified : F"(((!((u11.next_8==1)&&(u2.ncs_5_7==1)))&&(u11.next_18==1))&&(u6.ncs_9_3==1))" & GF"((u11.next_16==1)&&(u10.p1_3_9==1))"
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t10, t12, t13, t14, t15, t28, t30, t37, t50, t64, t67, t70, t82, t85, t87, t90, t91, ...1344
Detected timeout of ITS tools.
[2023-04-07 06:37:18] [INFO ] Flatten gal took : 84 ms
[2023-04-07 06:37:18] [INFO ] Input system was already deterministic with 1003 transitions.
[2023-04-07 06:37:18] [INFO ] Transformed 458 places.
[2023-04-07 06:37:18] [INFO ] Transformed 1003 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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-04-07 06:37:48] [INFO ] Time to serialize gal into /tmp/LTLFireability3527389900027438971.gal : 62 ms
[2023-04-07 06:37:48] [INFO ] Time to serialize properties into /tmp/LTLFireability17063121681622004721.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3527389900027438971.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17063121681622004721.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G(!("(((!((next_8==1)&&(ncs_5_7==1)))&&(next_18==1))&&(ncs_9_3==1))")))||(F(G(!("((next_16==1)&&(p1_3_9==1))"))))))
Formula 0 simplified : F"(((!((next_8==1)&&(ncs_5_7==1)))&&(next_18==1))&&(ncs_9_3==1))" & GF"((next_16==1)&&(p1_3_9==1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.120: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.121: Initializing POR dependencies: labels 1005, guards 1003
pins2lts-mc-linux64( 3/ 8), 0.124: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.139: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.145: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.171: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.196: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 17.512: LTL layer: formula: ([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))
pins2lts-mc-linux64( 5/ 8), 17.513: "([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 17.513: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 18.595: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 18.642: There are 1006 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 18.642: State length is 459, there are 1012 groups
pins2lts-mc-linux64( 0/ 8), 18.642: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 18.642: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 18.642: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 18.642: Visible groups: 0 / 1012, labels: 2 / 1006
pins2lts-mc-linux64( 0/ 8), 18.642: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 18.642: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 18.749: [Blue] ~107 levels ~960 states ~1680 transitions
pins2lts-mc-linux64( 3/ 8), 18.862: [Blue] ~226 levels ~1920 states ~2912 transitions
pins2lts-mc-linux64( 3/ 8), 19.126: [Blue] ~421 levels ~3840 states ~5488 transitions
pins2lts-mc-linux64( 3/ 8), 20.431: [Blue] ~821 levels ~7680 states ~11128 transitions
pins2lts-mc-linux64( 3/ 8), 21.057: [Blue] ~1673 levels ~15360 states ~22512 transitions
pins2lts-mc-linux64( 0/ 8), 23.630: [Blue] ~3256 levels ~30720 states ~41352 transitions
pins2lts-mc-linux64( 7/ 8), 33.515: [Blue] ~6387 levels ~61440 states ~78736 transitions
pins2lts-mc-linux64( 3/ 8), 51.991: [Blue] ~12733 levels ~122880 states ~159528 transitions
pins2lts-mc-linux64( 6/ 8), 91.026: [Blue] ~25927 levels ~245760 states ~309096 transitions
pins2lts-mc-linux64( 6/ 8), 142.687: [Blue] ~51892 levels ~491520 states ~619616 transitions
pins2lts-mc-linux64( 6/ 8), 213.768: [Blue] ~102939 levels ~983040 states ~1237120 transitions
pins2lts-mc-linux64( 6/ 8), 291.092: [Blue] ~204578 levels ~1966080 states ~2464768 transitions
pins2lts-mc-linux64( 6/ 8), 456.141: [Blue] ~408130 levels ~3932160 states ~4899728 transitions
pins2lts-mc-linux64( 6/ 8), 781.484: [Blue] ~815645 levels ~7864320 states ~9828472 transitions
pins2lts-mc-linux64( 6/ 8), 1440.158: [Blue] ~1629480 levels ~15728640 states ~19694336 transitions
pins2lts-mc-linux64( 6/ 8), 2880.966: [Blue] ~3239937 levels ~31457280 states ~39283480 transitions
pins2lts-mc-linux64( 2/ 8), 2992.649: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2992.703:
pins2lts-mc-linux64( 0/ 8), 2992.703: Explored 31481847 states 39138929 transitions, fanout: 1.243
pins2lts-mc-linux64( 0/ 8), 2992.703: Total exploration time 2974.060 sec (2973.980 sec minimum, 2974.011 sec on average)
pins2lts-mc-linux64( 0/ 8), 2992.703: States per second: 10585, Transitions per second: 13160
pins2lts-mc-linux64( 0/ 8), 2992.703:
pins2lts-mc-linux64( 0/ 8), 2992.703: State space has 42772602 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 2992.703: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2992.703: blue states: 31481847 (73.60%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2992.703: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2992.703: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2992.703:
pins2lts-mc-linux64( 0/ 8), 2992.703: Total memory used for local state coloring: 389.3MB
pins2lts-mc-linux64( 0/ 8), 2992.703:
pins2lts-mc-linux64( 0/ 8), 2992.703: Queue width: 8B, total height: 25515986, memory: 194.67MB
pins2lts-mc-linux64( 0/ 8), 2992.703: Tree memory: 582.3MB, 14.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 2992.703: Tree fill ratio (roots/leafs): 31.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 2992.703: Stored 1020 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2992.703: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2992.703: Est. total memory use: 777.0MB (~1218.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1037227273581693236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1037227273581693236;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '([](!(LTLAPp0==true))||(!(LTLAPp0==true)&&<>([](!(LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 651332 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040196 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="Anderson-PT-10"
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 Anderson-PT-10, 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 r517-tall-167987243300052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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