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.r103-tall-167814478600628.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 lolaxred
Input is DLCround-PT-03b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478600628
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-03b-LTLFireability-00
FORMULA_NAME DLCround-PT-03b-LTLFireability-01
FORMULA_NAME DLCround-PT-03b-LTLFireability-02
FORMULA_NAME DLCround-PT-03b-LTLFireability-03
FORMULA_NAME DLCround-PT-03b-LTLFireability-04
FORMULA_NAME DLCround-PT-03b-LTLFireability-05
FORMULA_NAME DLCround-PT-03b-LTLFireability-06
FORMULA_NAME DLCround-PT-03b-LTLFireability-07
FORMULA_NAME DLCround-PT-03b-LTLFireability-08
FORMULA_NAME DLCround-PT-03b-LTLFireability-09
FORMULA_NAME DLCround-PT-03b-LTLFireability-10
FORMULA_NAME DLCround-PT-03b-LTLFireability-11
FORMULA_NAME DLCround-PT-03b-LTLFireability-12
FORMULA_NAME DLCround-PT-03b-LTLFireability-13
FORMULA_NAME DLCround-PT-03b-LTLFireability-14
FORMULA_NAME DLCround-PT-03b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678270796886

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-03b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 10:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 10:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:19:58] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-08 10:19:58] [INFO ] Transformed 1383 places.
[2023-03-08 10:19:58] [INFO ] Transformed 1887 transitions.
[2023-03-08 10:19:58] [INFO ] Found NUPN structural information;
[2023-03-08 10:19:58] [INFO ] Parsed PT model containing 1383 places and 1887 transitions and 4809 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DLCround-PT-03b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-03b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 1383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1383/1383 places, 1887/1887 transitions.
Discarding 231 places :
Symmetric choice reduction at 0 with 231 rule applications. Total rules 231 place count 1152 transition count 1656
Iterating global reduction 0 with 231 rules applied. Total rules applied 462 place count 1152 transition count 1656
Discarding 176 places :
Symmetric choice reduction at 0 with 176 rule applications. Total rules 638 place count 976 transition count 1480
Iterating global reduction 0 with 176 rules applied. Total rules applied 814 place count 976 transition count 1480
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 818 place count 976 transition count 1476
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 860 place count 934 transition count 1407
Iterating global reduction 1 with 42 rules applied. Total rules applied 902 place count 934 transition count 1407
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 932 place count 904 transition count 1377
Iterating global reduction 1 with 30 rules applied. Total rules applied 962 place count 904 transition count 1377
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 965 place count 904 transition count 1374
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 978 place count 891 transition count 1361
Iterating global reduction 2 with 13 rules applied. Total rules applied 991 place count 891 transition count 1361
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1003 place count 879 transition count 1349
Iterating global reduction 2 with 12 rules applied. Total rules applied 1015 place count 879 transition count 1349
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1027 place count 867 transition count 1337
Iterating global reduction 2 with 12 rules applied. Total rules applied 1039 place count 867 transition count 1337
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1049 place count 857 transition count 1327
Iterating global reduction 2 with 10 rules applied. Total rules applied 1059 place count 857 transition count 1327
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1065 place count 851 transition count 1321
Iterating global reduction 2 with 6 rules applied. Total rules applied 1071 place count 851 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1076 place count 846 transition count 1316
Iterating global reduction 2 with 5 rules applied. Total rules applied 1081 place count 846 transition count 1316
Applied a total of 1081 rules in 501 ms. Remains 846 /1383 variables (removed 537) and now considering 1316/1887 (removed 571) transitions.
// Phase 1: matrix 1316 rows 846 cols
[2023-03-08 10:19:59] [INFO ] Computed 52 place invariants in 30 ms
[2023-03-08 10:19:59] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-08 10:19:59] [INFO ] Invariant cache hit.
[2023-03-08 10:20:00] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
[2023-03-08 10:20:00] [INFO ] Invariant cache hit.
[2023-03-08 10:20:00] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 846/1383 places, 1316/1887 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1896 ms. Remains : 846/1383 places, 1316/1887 transitions.
Support contains 33 out of 846 places after structural reductions.
[2023-03-08 10:20:00] [INFO ] Flatten gal took : 92 ms
[2023-03-08 10:20:00] [INFO ] Flatten gal took : 52 ms
[2023-03-08 10:20:01] [INFO ] Input system was already deterministic with 1316 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:20:01] [INFO ] Invariant cache hit.
[2023-03-08 10:20:01] [INFO ] [Real]Absence check using 52 positive place invariants in 20 ms returned sat
[2023-03-08 10:20:01] [INFO ] After 345ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 10:20:02] [INFO ] After 435ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-08 10:20:02] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 235 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 4 ms.
FORMULA DLCround-PT-03b-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 112 stabilizing places and 112 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (p0&&G(p1)))))))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 838 transition count 1308
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 838 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 832 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 832 transition count 1301
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 829 transition count 1298
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 829 transition count 1298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 829 transition count 1297
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 827 transition count 1295
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 827 transition count 1295
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 825 transition count 1293
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 825 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 823 transition count 1291
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 823 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 822 transition count 1290
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 821 transition count 1289
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 821 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 820 transition count 1288
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 819 transition count 1287
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 819 transition count 1287
Applied a total of 55 rules in 304 ms. Remains 819 /846 variables (removed 27) and now considering 1287/1316 (removed 29) transitions.
// Phase 1: matrix 1287 rows 819 cols
[2023-03-08 10:20:02] [INFO ] Computed 52 place invariants in 13 ms
[2023-03-08 10:20:02] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-08 10:20:02] [INFO ] Invariant cache hit.
[2023-03-08 10:20:03] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2023-03-08 10:20:03] [INFO ] Invariant cache hit.
[2023-03-08 10:20:03] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 819/846 places, 1287/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1448 ms. Remains : 819/846 places, 1287/1316 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s352 1), p0:(EQ s39 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 4 ms.
FORMULA DLCround-PT-03b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-00 finished in 1786 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1)) U X(p2))))'
Support contains 3 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 838 transition count 1308
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 838 transition count 1308
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 832 transition count 1301
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 832 transition count 1301
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 828 transition count 1297
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 828 transition count 1297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 828 transition count 1296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 826 transition count 1294
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 826 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 824 transition count 1292
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 824 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 822 transition count 1290
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 821 transition count 1289
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 821 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 820 transition count 1288
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 819 transition count 1287
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 818 transition count 1286
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 818 transition count 1286
Applied a total of 57 rules in 197 ms. Remains 818 /846 variables (removed 28) and now considering 1286/1316 (removed 30) transitions.
// Phase 1: matrix 1286 rows 818 cols
[2023-03-08 10:20:04] [INFO ] Computed 52 place invariants in 5 ms
[2023-03-08 10:20:04] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 10:20:04] [INFO ] Invariant cache hit.
[2023-03-08 10:20:05] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2023-03-08 10:20:05] [INFO ] Invariant cache hit.
[2023-03-08 10:20:05] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 818/846 places, 1286/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1342 ms. Remains : 818/846 places, 1286/1316 transitions.
Stuttering acceptance computed with spot in 458 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s395 1), p0:(EQ s463 1), p2:(NEQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 355 ms.
Product exploration explored 100000 steps with 33333 reset in 295 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT (OR p1 p0))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p2))
Knowledge based reduction with 12 factoid took 237 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03b-LTLFireability-01 finished in 2746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Graph (trivial) has 797 edges and 846 vertex of which 254 / 846 are part of one of the 20 SCC in 5 ms
Free SCC test removed 234 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 157 place count 611 transition count 905
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 182 rules applied. Total rules applied 339 place count 455 transition count 879
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 358 place count 438 transition count 877
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 437 transition count 877
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 359 place count 437 transition count 820
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 473 place count 380 transition count 820
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 508 place count 345 transition count 677
Iterating global reduction 4 with 35 rules applied. Total rules applied 543 place count 345 transition count 677
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 547 place count 345 transition count 673
Performed 124 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 124 places in 1 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 5 with 248 rules applied. Total rules applied 795 place count 221 transition count 545
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 799 place count 221 transition count 541
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 810 place count 210 transition count 476
Iterating global reduction 6 with 11 rules applied. Total rules applied 821 place count 210 transition count 476
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 832 place count 210 transition count 465
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 866 place count 193 transition count 550
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 870 place count 189 transition count 512
Iterating global reduction 7 with 4 rules applied. Total rules applied 874 place count 189 transition count 512
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 892 place count 189 transition count 494
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 916 place count 189 transition count 470
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 924 place count 181 transition count 454
Iterating global reduction 8 with 8 rules applied. Total rules applied 932 place count 181 transition count 454
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 940 place count 173 transition count 394
Iterating global reduction 8 with 8 rules applied. Total rules applied 948 place count 173 transition count 394
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 956 place count 173 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 957 place count 172 transition count 385
Applied a total of 957 rules in 159 ms. Remains 172 /846 variables (removed 674) and now considering 385/1316 (removed 931) transitions.
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
// Phase 1: matrix 367 rows 172 cols
[2023-03-08 10:20:07] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-08 10:20:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
[2023-03-08 10:20:07] [INFO ] Invariant cache hit.
[2023-03-08 10:20:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 10:20:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 10:20:07] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 367 transitions (discarded 18 similar events)
[2023-03-08 10:20:07] [INFO ] Invariant cache hit.
[2023-03-08 10:20:07] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/846 places, 385/1316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 580 ms. Remains : 172/846 places, 385/1316 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s29 0) (EQ s153 0)), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 120 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-03b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-04 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Graph (trivial) has 799 edges and 846 vertex of which 254 / 846 are part of one of the 20 SCC in 1 ms
Free SCC test removed 234 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 611 transition count 902
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 185 rules applied. Total rules applied 345 place count 452 transition count 876
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 364 place count 435 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 434 transition count 874
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 56 Pre rules applied. Total rules applied 365 place count 434 transition count 818
Deduced a syphon composed of 56 places in 6 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 477 place count 378 transition count 818
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 513 place count 342 transition count 674
Iterating global reduction 4 with 36 rules applied. Total rules applied 549 place count 342 transition count 674
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 553 place count 342 transition count 670
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 553 place count 342 transition count 669
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 341 transition count 669
Performed 123 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 801 place count 218 transition count 542
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 805 place count 218 transition count 538
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 816 place count 207 transition count 473
Iterating global reduction 6 with 11 rules applied. Total rules applied 827 place count 207 transition count 473
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 838 place count 207 transition count 462
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 870 place count 191 transition count 539
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 874 place count 187 transition count 501
Iterating global reduction 7 with 4 rules applied. Total rules applied 878 place count 187 transition count 501
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 895 place count 187 transition count 484
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 8 with 21 rules applied. Total rules applied 916 place count 187 transition count 463
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 924 place count 179 transition count 447
Iterating global reduction 8 with 8 rules applied. Total rules applied 932 place count 179 transition count 447
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 940 place count 171 transition count 389
Iterating global reduction 8 with 8 rules applied. Total rules applied 948 place count 171 transition count 389
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 956 place count 171 transition count 381
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 957 place count 170 transition count 380
Applied a total of 957 rules in 135 ms. Remains 170 /846 variables (removed 676) and now considering 380/1316 (removed 936) transitions.
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 364 transitions (discarded 16 similar events)
// Phase 1: matrix 364 rows 170 cols
[2023-03-08 10:20:07] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-08 10:20:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 364 transitions (discarded 16 similar events)
[2023-03-08 10:20:07] [INFO ] Invariant cache hit.
[2023-03-08 10:20:07] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-08 10:20:07] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-08 10:20:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:20:07] [INFO ] Flow matrix only has 364 transitions (discarded 16 similar events)
[2023-03-08 10:20:07] [INFO ] Invariant cache hit.
[2023-03-08 10:20:08] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/846 places, 380/1316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 170/846 places, 380/1316 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s99 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 780 steps with 0 reset in 8 ms.
FORMULA DLCround-PT-03b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-05 finished in 577 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 837 transition count 1307
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 837 transition count 1307
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 831 transition count 1300
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 831 transition count 1300
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 828 transition count 1297
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 828 transition count 1297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 828 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 827 transition count 1295
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 827 transition count 1295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 826 transition count 1294
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 826 transition count 1294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 825 transition count 1293
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 825 transition count 1293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 824 transition count 1292
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 824 transition count 1292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 823 transition count 1291
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 823 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 822 transition count 1290
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 822 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 821 transition count 1289
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 821 transition count 1289
Applied a total of 51 rules in 170 ms. Remains 821 /846 variables (removed 25) and now considering 1289/1316 (removed 27) transitions.
// Phase 1: matrix 1289 rows 821 cols
[2023-03-08 10:20:08] [INFO ] Computed 52 place invariants in 5 ms
[2023-03-08 10:20:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 10:20:08] [INFO ] Invariant cache hit.
[2023-03-08 10:20:09] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-08 10:20:09] [INFO ] Invariant cache hit.
[2023-03-08 10:20:09] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 821/846 places, 1289/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1357 ms. Remains : 821/846 places, 1289/1316 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-03b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-07 finished in 1481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 836 transition count 1306
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 836 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 829 transition count 1298
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 829 transition count 1298
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 825 transition count 1294
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 825 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 825 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 823 transition count 1291
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 823 transition count 1291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 821 transition count 1289
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 821 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 819 transition count 1287
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 818 transition count 1286
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 818 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 817 transition count 1285
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 817 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 816 transition count 1284
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 816 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 815 transition count 1283
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 815 transition count 1283
Applied a total of 63 rules in 174 ms. Remains 815 /846 variables (removed 31) and now considering 1283/1316 (removed 33) transitions.
// Phase 1: matrix 1283 rows 815 cols
[2023-03-08 10:20:09] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-08 10:20:10] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 10:20:10] [INFO ] Invariant cache hit.
[2023-03-08 10:20:10] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-08 10:20:10] [INFO ] Invariant cache hit.
[2023-03-08 10:20:10] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/846 places, 1283/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1326 ms. Remains : 815/846 places, 1283/1316 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s465 1) (EQ s741 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 34181 steps with 12 reset in 82 ms.
FORMULA DLCround-PT-03b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-09 finished in 1522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!G(X(X(G(X(p0))))) U p1))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 836 transition count 1306
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 836 transition count 1306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 830 transition count 1300
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 830 transition count 1300
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 827 transition count 1297
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 827 transition count 1297
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 825 transition count 1295
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 825 transition count 1295
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 823 transition count 1293
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 823 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 821 transition count 1291
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 821 transition count 1291
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 820 transition count 1290
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 820 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 819 transition count 1289
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 819 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 818 transition count 1288
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 818 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 817 transition count 1287
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 817 transition count 1287
Applied a total of 58 rules in 144 ms. Remains 817 /846 variables (removed 29) and now considering 1287/1316 (removed 29) transitions.
// Phase 1: matrix 1287 rows 817 cols
[2023-03-08 10:20:11] [INFO ] Computed 52 place invariants in 12 ms
[2023-03-08 10:20:11] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 10:20:11] [INFO ] Invariant cache hit.
[2023-03-08 10:20:11] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2023-03-08 10:20:12] [INFO ] Invariant cache hit.
[2023-03-08 10:20:12] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/846 places, 1287/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1247 ms. Remains : 817/846 places, 1287/1316 transitions.
Stuttering acceptance computed with spot in 140 ms :[p0, (NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=1, aps=[p0:(EQ s47 1), p1:(AND (EQ s47 1) (EQ s690 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]]
Stuttering criterion allowed to conclude after 86306 steps with 1 reset in 239 ms.
FORMULA DLCround-PT-03b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-10 finished in 1661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(F(!p0)) U p1))))))'
Support contains 3 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 837 transition count 1307
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 837 transition count 1307
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 830 transition count 1299
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 830 transition count 1299
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 826 transition count 1295
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 826 transition count 1295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 826 transition count 1294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 824 transition count 1292
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 824 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 822 transition count 1290
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 822 transition count 1290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 820 transition count 1288
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 820 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 819 transition count 1287
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 818 transition count 1286
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 818 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 817 transition count 1285
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 817 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 816 transition count 1284
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 816 transition count 1284
Applied a total of 61 rules in 119 ms. Remains 816 /846 variables (removed 30) and now considering 1284/1316 (removed 32) transitions.
// Phase 1: matrix 1284 rows 816 cols
[2023-03-08 10:20:12] [INFO ] Computed 52 place invariants in 10 ms
[2023-03-08 10:20:13] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 10:20:13] [INFO ] Invariant cache hit.
[2023-03-08 10:20:13] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2023-03-08 10:20:13] [INFO ] Invariant cache hit.
[2023-03-08 10:20:14] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 816/846 places, 1284/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1207 ms. Remains : 816/846 places, 1284/1316 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s55 1), p0:(AND (EQ s29 1) (EQ s561 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20 reset in 235 ms.
Product exploration explored 100000 steps with 26 reset in 324 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/816 stabilizing places and 100/1284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Finished random walk after 988 steps, including 0 resets, run visited all 3 properties in 23 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
[2023-03-08 10:20:16] [INFO ] Invariant cache hit.
[2023-03-08 10:20:16] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-08 10:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:20:17] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2023-03-08 10:20:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:20:17] [INFO ] [Nat]Absence check using 52 positive place invariants in 25 ms returned sat
[2023-03-08 10:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:20:18] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2023-03-08 10:20:18] [INFO ] Computed and/alt/rep : 1251/2359/1251 causal constraints (skipped 32 transitions) in 66 ms.
[2023-03-08 10:20:32] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 10:20:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Applied a total of 0 rules in 10 ms. Remains 816 /816 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
[2023-03-08 10:20:32] [INFO ] Invariant cache hit.
[2023-03-08 10:20:32] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 10:20:32] [INFO ] Invariant cache hit.
[2023-03-08 10:20:33] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-08 10:20:33] [INFO ] Invariant cache hit.
[2023-03-08 10:20:33] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1155 ms. Remains : 816/816 places, 1284/1284 transitions.
Computed a total of 100 stabilizing places and 100 stable transitions
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/816 stabilizing places and 100/1284 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Finished random walk after 2261 steps, including 0 resets, run visited all 3 properties in 25 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
[2023-03-08 10:20:35] [INFO ] Invariant cache hit.
[2023-03-08 10:20:35] [INFO ] [Real]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-08 10:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:20:36] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-08 10:20:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:20:36] [INFO ] [Nat]Absence check using 52 positive place invariants in 25 ms returned sat
[2023-03-08 10:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:20:37] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2023-03-08 10:20:37] [INFO ] Computed and/alt/rep : 1251/2359/1251 causal constraints (skipped 32 transitions) in 55 ms.
[2023-03-08 10:20:51] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 10:20:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Product exploration explored 100000 steps with 18 reset in 228 ms.
Product exploration explored 100000 steps with 18 reset in 318 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Graph (trivial) has 766 edges and 816 vertex of which 248 / 816 are part of one of the 20 SCC in 2 ms
Free SCC test removed 228 places
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 588 transition count 1036
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 16 rules applied. Total rules applied 156 place count 588 transition count 1028
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 156 place count 588 transition count 1032
Deduced a syphon composed of 155 places in 1 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 588 transition count 1032
Discarding 88 places :
Symmetric choice reduction at 2 with 88 rule applications. Total rules 252 place count 500 transition count 836
Deduced a syphon composed of 99 places in 1 ms
Iterating global reduction 2 with 88 rules applied. Total rules applied 340 place count 500 transition count 836
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 344 place count 500 transition count 832
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 273 places in 0 ms
Iterating global reduction 3 with 174 rules applied. Total rules applied 518 place count 500 transition count 836
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 522 place count 500 transition count 832
Discarding 140 places :
Symmetric choice reduction at 4 with 140 rule applications. Total rules 662 place count 360 transition count 632
Deduced a syphon composed of 145 places in 0 ms
Iterating global reduction 4 with 140 rules applied. Total rules applied 802 place count 360 transition count 632
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 814 place count 360 transition count 620
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 818 place count 356 transition count 616
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 822 place count 356 transition count 616
Performed 23 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 23 rules applied. Total rules applied 845 place count 356 transition count 773
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 857 place count 356 transition count 761
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 888 place count 325 transition count 667
Deduced a syphon composed of 137 places in 0 ms
Iterating global reduction 6 with 31 rules applied. Total rules applied 919 place count 325 transition count 667
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 939 place count 325 transition count 647
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 947 place count 317 transition count 631
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 955 place count 317 transition count 631
Deduced a syphon composed of 129 places in 0 ms
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 980 place count 317 transition count 606
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 988 place count 309 transition count 590
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 996 place count 309 transition count 590
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1004 place count 301 transition count 528
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1012 place count 301 transition count 528
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 1024 place count 301 transition count 516
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1032 place count 293 transition count 504
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 8 with 8 rules applied. Total rules applied 1040 place count 293 transition count 504
Deduced a syphon composed of 121 places in 0 ms
Applied a total of 1040 rules in 169 ms. Remains 293 /816 variables (removed 523) and now considering 504/1284 (removed 780) transitions.
[2023-03-08 10:20:52] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 10:20:52] [INFO ] Flow matrix only has 491 transitions (discarded 13 similar events)
// Phase 1: matrix 491 rows 293 cols
[2023-03-08 10:20:52] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-08 10:20:53] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 293/816 places, 504/1284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 368 ms. Remains : 293/816 places, 504/1284 transitions.
Support contains 3 out of 816 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 816/816 places, 1284/1284 transitions.
Applied a total of 0 rules in 32 ms. Remains 816 /816 variables (removed 0) and now considering 1284/1284 (removed 0) transitions.
// Phase 1: matrix 1284 rows 816 cols
[2023-03-08 10:20:53] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-08 10:20:53] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 10:20:53] [INFO ] Invariant cache hit.
[2023-03-08 10:20:53] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2023-03-08 10:20:53] [INFO ] Invariant cache hit.
[2023-03-08 10:20:54] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1216 ms. Remains : 816/816 places, 1284/1284 transitions.
Treatment of property DLCround-PT-03b-LTLFireability-11 finished in 41588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(F((G(p2)||p1))&&X(p3)))))'
Support contains 7 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 836 transition count 1306
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 836 transition count 1306
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 829 transition count 1298
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 829 transition count 1298
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 825 transition count 1294
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 825 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 825 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 823 transition count 1291
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 823 transition count 1291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 821 transition count 1289
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 821 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 819 transition count 1287
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 819 transition count 1287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 818 transition count 1286
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 818 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 817 transition count 1285
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 817 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 816 transition count 1284
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 816 transition count 1284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 815 transition count 1283
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 815 transition count 1283
Applied a total of 63 rules in 138 ms. Remains 815 /846 variables (removed 31) and now considering 1283/1316 (removed 33) transitions.
// Phase 1: matrix 1283 rows 815 cols
[2023-03-08 10:20:54] [INFO ] Computed 52 place invariants in 8 ms
[2023-03-08 10:20:54] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 10:20:54] [INFO ] Invariant cache hit.
[2023-03-08 10:20:55] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-08 10:20:55] [INFO ] Invariant cache hit.
[2023-03-08 10:20:55] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 815/846 places, 1283/1316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1226 ms. Remains : 815/846 places, 1283/1316 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s495 0) (EQ s741 0)), p2:(EQ s694 0), p0:(OR (EQ s25 0) (EQ s699 0)), p3:(AND (EQ s376 1) (EQ s657 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 321 ms.
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND p1 p2 p0 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p3))))
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-03b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-03b-LTLFireability-12 finished in 2220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Graph (trivial) has 797 edges and 846 vertex of which 223 / 846 are part of one of the 20 SCC in 3 ms
Free SCC test removed 203 places
Ensure Unique test removed 218 transitions
Reduce isomorphic transitions removed 218 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 169 place count 642 transition count 929
Reduce places removed 168 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 194 rules applied. Total rules applied 363 place count 474 transition count 903
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 382 place count 457 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 456 transition count 901
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 383 place count 456 transition count 839
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 507 place count 394 transition count 839
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 538 place count 363 transition count 709
Iterating global reduction 4 with 31 rules applied. Total rules applied 569 place count 363 transition count 709
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 572 place count 363 transition count 706
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 572 place count 363 transition count 705
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 574 place count 362 transition count 705
Performed 132 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 132 places in 0 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 5 with 264 rules applied. Total rules applied 838 place count 230 transition count 569
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 843 place count 230 transition count 564
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 854 place count 219 transition count 499
Iterating global reduction 6 with 11 rules applied. Total rules applied 865 place count 219 transition count 499
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 875 place count 219 transition count 489
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 879 place count 217 transition count 487
Performed 18 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 915 place count 199 transition count 580
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 917 place count 199 transition count 578
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 922 place count 194 transition count 532
Iterating global reduction 8 with 5 rules applied. Total rules applied 927 place count 194 transition count 532
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 944 place count 194 transition count 515
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 961 place count 194 transition count 498
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 967 place count 188 transition count 486
Iterating global reduction 9 with 6 rules applied. Total rules applied 973 place count 188 transition count 486
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 979 place count 182 transition count 444
Iterating global reduction 9 with 6 rules applied. Total rules applied 985 place count 182 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 991 place count 182 transition count 438
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 992 place count 181 transition count 437
Applied a total of 992 rules in 90 ms. Remains 181 /846 variables (removed 665) and now considering 437/1316 (removed 879) transitions.
[2023-03-08 10:20:56] [INFO ] Flow matrix only has 414 transitions (discarded 23 similar events)
// Phase 1: matrix 414 rows 181 cols
[2023-03-08 10:20:56] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-08 10:20:56] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 10:20:56] [INFO ] Flow matrix only has 414 transitions (discarded 23 similar events)
[2023-03-08 10:20:56] [INFO ] Invariant cache hit.
[2023-03-08 10:20:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 10:20:57] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 10:20:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:20:57] [INFO ] Flow matrix only has 414 transitions (discarded 23 similar events)
[2023-03-08 10:20:57] [INFO ] Invariant cache hit.
[2023-03-08 10:20:57] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/846 places, 437/1316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 506 ms. Remains : 181/846 places, 437/1316 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s15 1), p1:(NEQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-13 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 846 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Graph (trivial) has 796 edges and 846 vertex of which 233 / 846 are part of one of the 20 SCC in 1 ms
Free SCC test removed 213 places
Ensure Unique test removed 230 transitions
Reduce isomorphic transitions removed 230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 165 place count 632 transition count 921
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 190 rules applied. Total rules applied 355 place count 468 transition count 895
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 374 place count 451 transition count 893
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 376 place count 450 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 377 place count 449 transition count 892
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 60 Pre rules applied. Total rules applied 377 place count 449 transition count 832
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 497 place count 389 transition count 832
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 529 place count 357 transition count 698
Iterating global reduction 5 with 32 rules applied. Total rules applied 561 place count 357 transition count 698
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 565 place count 357 transition count 694
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 565 place count 357 transition count 693
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 567 place count 356 transition count 693
Performed 130 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 130 places in 0 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 6 with 260 rules applied. Total rules applied 827 place count 226 transition count 559
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 831 place count 226 transition count 555
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 842 place count 215 transition count 490
Iterating global reduction 7 with 11 rules applied. Total rules applied 853 place count 215 transition count 490
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 863 place count 215 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 865 place count 214 transition count 479
Performed 17 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 899 place count 197 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 900 place count 197 transition count 563
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 904 place count 193 transition count 525
Iterating global reduction 9 with 4 rules applied. Total rules applied 908 place count 193 transition count 525
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 925 place count 193 transition count 508
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 945 place count 193 transition count 488
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 951 place count 187 transition count 476
Iterating global reduction 10 with 6 rules applied. Total rules applied 957 place count 187 transition count 476
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 963 place count 181 transition count 432
Iterating global reduction 10 with 6 rules applied. Total rules applied 969 place count 181 transition count 432
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 975 place count 181 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 976 place count 180 transition count 425
Applied a total of 976 rules in 101 ms. Remains 180 /846 variables (removed 666) and now considering 425/1316 (removed 891) transitions.
[2023-03-08 10:20:57] [INFO ] Flow matrix only has 407 transitions (discarded 18 similar events)
// Phase 1: matrix 407 rows 180 cols
[2023-03-08 10:20:57] [INFO ] Computed 52 place invariants in 7 ms
[2023-03-08 10:20:57] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 10:20:57] [INFO ] Flow matrix only has 407 transitions (discarded 18 similar events)
[2023-03-08 10:20:57] [INFO ] Invariant cache hit.
[2023-03-08 10:20:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 10:20:57] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-08 10:20:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:20:57] [INFO ] Flow matrix only has 407 transitions (discarded 18 similar events)
[2023-03-08 10:20:57] [INFO ] Invariant cache hit.
[2023-03-08 10:20:57] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 180/846 places, 425/1316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 180/846 places, 425/1316 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DLCround-PT-03b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s21 1), p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-03b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-03b-LTLFireability-14 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((G(F(!p0)) U p1))))))'
Found a Lengthening insensitive property : DLCround-PT-03b-LTLFireability-11
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, p0, (NOT p1)]
Support contains 3 out of 846 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 846/846 places, 1316/1316 transitions.
Graph (trivial) has 798 edges and 846 vertex of which 254 / 846 are part of one of the 20 SCC in 1 ms
Free SCC test removed 234 places
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 160 place count 611 transition count 902
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 185 rules applied. Total rules applied 345 place count 452 transition count 876
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 19 rules applied. Total rules applied 364 place count 435 transition count 874
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 434 transition count 874
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 365 place count 434 transition count 819
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 475 place count 379 transition count 819
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 510 place count 344 transition count 676
Iterating global reduction 4 with 35 rules applied. Total rules applied 545 place count 344 transition count 676
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 549 place count 344 transition count 672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 549 place count 344 transition count 671
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 551 place count 343 transition count 671
Performed 123 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 797 place count 220 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 801 place count 220 transition count 540
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 813 place count 208 transition count 468
Iterating global reduction 6 with 12 rules applied. Total rules applied 825 place count 208 transition count 468
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 837 place count 208 transition count 456
Performed 16 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 869 place count 192 transition count 533
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 873 place count 188 transition count 495
Iterating global reduction 7 with 4 rules applied. Total rules applied 877 place count 188 transition count 495
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 894 place count 188 transition count 478
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 898 place count 188 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 899 place count 187 transition count 473
Applied a total of 899 rules in 83 ms. Remains 187 /846 variables (removed 659) and now considering 473/1316 (removed 843) transitions.
[2023-03-08 10:20:58] [INFO ] Flow matrix only has 449 transitions (discarded 24 similar events)
// Phase 1: matrix 449 rows 187 cols
[2023-03-08 10:20:58] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-08 10:20:58] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 10:20:58] [INFO ] Flow matrix only has 449 transitions (discarded 24 similar events)
[2023-03-08 10:20:58] [INFO ] Invariant cache hit.
[2023-03-08 10:20:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 10:20:58] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-08 10:20:58] [INFO ] Flow matrix only has 449 transitions (discarded 24 similar events)
[2023-03-08 10:20:58] [INFO ] Invariant cache hit.
[2023-03-08 10:20:58] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 187/846 places, 473/1316 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 593 ms. Remains : 187/846 places, 473/1316 transitions.
Running random walk in product with property : DLCround-PT-03b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(NOT p1), acceptance={0} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s6 1), p0:(AND (EQ s2 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property DLCround-PT-03b-LTLFireability-11 finished in 956 ms.
FORMULA DLCround-PT-03b-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 10:20:58] [INFO ] Flatten gal took : 44 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 60650 ms.
ITS solved all properties within timeout

BK_STOP 1678270859959

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="DLCround-PT-03b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DLCround-PT-03b, 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 r103-tall-167814478600628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-03b.tgz
mv DLCround-PT-03b 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 ;