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.r137-smll-167819417900284.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 ltsminxred
Input is DiscoveryGPU-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819417900284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 13:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 22K 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 DiscoveryGPU-PT-06a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678772351661

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 05:39:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 05:39:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 05:39:15] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-14 05:39:15] [INFO ] Transformed 63 places.
[2023-03-14 05:39:15] [INFO ] Transformed 85 transitions.
[2023-03-14 05:39:15] [INFO ] Found NUPN structural information;
[2023-03-14 05:39:15] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 80
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 80
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 54 transition count 76
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 54 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 51 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 51 transition count 70
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 51 transition count 67
Applied a total of 27 rules in 51 ms. Remains 51 /63 variables (removed 12) and now considering 67/85 (removed 18) transitions.
// Phase 1: matrix 67 rows 51 cols
[2023-03-14 05:39:16] [INFO ] Computed 2 place invariants in 8 ms
[2023-03-14 05:39:16] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-14 05:39:16] [INFO ] Invariant cache hit.
[2023-03-14 05:39:16] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-14 05:39:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-14 05:39:16] [INFO ] Invariant cache hit.
[2023-03-14 05:39:16] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/63 places, 67/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 51/63 places, 67/85 transitions.
Support contains 24 out of 51 places after structural reductions.
[2023-03-14 05:39:17] [INFO ] Flatten gal took : 63 ms
[2023-03-14 05:39:17] [INFO ] Flatten gal took : 23 ms
[2023-03-14 05:39:17] [INFO ] Input system was already deterministic with 67 transitions.
Finished random walk after 90 steps, including 1 resets, run visited all 24 properties in 37 ms. (steps per millisecond=2 )
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 153 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((!p0||X(p1)) U X(X(X(G(p2)))))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 64
Applied a total of 6 rules in 9 ms. Remains 48 /51 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-14 05:39:17] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 05:39:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-14 05:39:17] [INFO ] Invariant cache hit.
[2023-03-14 05:39:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:18] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-14 05:39:18] [INFO ] Invariant cache hit.
[2023-03-14 05:39:18] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/51 places, 64/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 48/51 places, 64/67 transitions.
Stuttering acceptance computed with spot in 598 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(AND (EQ s21 1) (EQ s46 1)), p0:(AND (EQ s32 1) (EQ s47 1)), p2:(AND (EQ s29 1) (EQ s44 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-00 finished in 1160 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))||G(p1)))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 66
Applied a total of 2 rules in 5 ms. Remains 50 /51 variables (removed 1) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 50 cols
[2023-03-14 05:39:18] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 05:39:18] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 05:39:18] [INFO ] Invariant cache hit.
[2023-03-14 05:39:19] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-14 05:39:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 66/67 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 299 ms. Remains : 49/51 places, 66/67 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s24 0) (EQ s48 0)), p1:(AND (EQ s32 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11674 reset in 655 ms.
Stack based approach found an accepted trace after 37 steps with 6 reset with depth 4 and stack size 4 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-04 finished in 1209 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(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(!p2&&X((!p0 U (p1||G(!p0))))))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 49 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 65
Applied a total of 4 rules in 9 ms. Remains 49 /51 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 49 cols
[2023-03-14 05:39:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 05:39:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-14 05:39:20] [INFO ] Invariant cache hit.
[2023-03-14 05:39:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:20] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-14 05:39:20] [INFO ] Invariant cache hit.
[2023-03-14 05:39:20] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 65/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 49/51 places, 65/67 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) p0), (AND p0 (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (EQ s3 1) (EQ s48 1))) (NOT (OR (AND (EQ s39 1) (EQ s47 1)) (AND (EQ s7 1) (EQ s47 1)) (AND (EQ s31 1) (EQ s47 1))))), p0:(OR (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-05 finished in 464 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 X(p1))&&(F(p0)||p2))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 64
Applied a total of 6 rules in 8 ms. Remains 48 /51 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-14 05:39:20] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 05:39:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-14 05:39:20] [INFO ] Invariant cache hit.
[2023-03-14 05:39:20] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:20] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-14 05:39:20] [INFO ] Invariant cache hit.
[2023-03-14 05:39:20] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/51 places, 64/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 48/51 places, 64/67 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s18 1), p2:(OR (EQ s37 0) (EQ s46 0)), p1:(AND (EQ s29 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 4 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-06 finished in 567 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 (G(p2)&&p1)))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Graph (complete) has 153 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 50 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 49 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 47 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 47 transition count 63
Applied a total of 7 rules in 24 ms. Remains 47 /51 variables (removed 4) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 47 cols
[2023-03-14 05:39:21] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-14 05:39:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-14 05:39:21] [INFO ] Invariant cache hit.
[2023-03-14 05:39:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-14 05:39:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 05:39:21] [INFO ] Invariant cache hit.
[2023-03-14 05:39:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/51 places, 63/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 47/51 places, 63/67 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p1)), p0, (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s45 1)), p2:(AND (EQ s30 1) (EQ s46 1)), p0:(AND (EQ s13 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1680 reset in 307 ms.
Stack based approach found an accepted trace after 194 steps with 3 reset with depth 31 and stack size 27 in 2 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-07 finished in 862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 64
Applied a total of 6 rules in 7 ms. Remains 48 /51 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 48 cols
[2023-03-14 05:39:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 05:39:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 05:39:22] [INFO ] Invariant cache hit.
[2023-03-14 05:39:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:22] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-14 05:39:22] [INFO ] Invariant cache hit.
[2023-03-14 05:39:22] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/51 places, 64/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 48/51 places, 64/67 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s11 1) (NEQ s47 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 38 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-08 finished in 522 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)&&(X((X(F(p3))&&p2))||p1))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 48 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 48 transition count 64
Applied a total of 6 rules in 8 ms. Remains 48 /51 variables (removed 3) and now considering 64/67 (removed 3) transitions.
[2023-03-14 05:39:22] [INFO ] Invariant cache hit.
[2023-03-14 05:39:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-14 05:39:22] [INFO ] Invariant cache hit.
[2023-03-14 05:39:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:22] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-14 05:39:22] [INFO ] Invariant cache hit.
[2023-03-14 05:39:22] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/51 places, 64/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 48/51 places, 64/67 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 0}, { cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s38 0) (EQ s46 0)), p3:(AND (EQ s38 1) (EQ s46 1)), p0:(OR (EQ s14 0) (EQ s46 0)), p2:(AND (EQ s22 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 316 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 147 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Detected a total of 9/48 stabilizing places and 7/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p3) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0 p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X (OR (AND p1 (NOT p0)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p1 (NOT p2)))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 (NOT p3) p0 (NOT p2))
Knowledge based reduction with 16 factoid took 844 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-10 finished in 2055 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Graph (complete) has 153 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 57 edges and 47 vertex of which 43 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (trivial) has 48 edges and 43 vertex of which 24 / 43 are part of one of the 12 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 31 transition count 55
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 25 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 21 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 21 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 17 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 17 transition count 27
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 13 transition count 19
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 13 transition count 19
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 9 transition count 15
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 9 transition count 15
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 2 with 4 rules applied. Total rules applied 65 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 5 transition count 10
Applied a total of 68 rules in 16 ms. Remains 5 /51 variables (removed 46) and now considering 10/67 (removed 57) transitions.
[2023-03-14 05:39:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2023-03-14 05:39:24] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-14 05:39:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-14 05:39:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-14 05:39:24] [INFO ] Invariant cache hit.
[2023-03-14 05:39:24] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-14 05:39:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 05:39:24] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
[2023-03-14 05:39:24] [INFO ] Invariant cache hit.
[2023-03-14 05:39:24] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/51 places, 10/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 5/51 places, 10/67 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-11 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Graph (complete) has 153 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 50 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 48 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 46 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 46 transition count 62
Applied a total of 9 rules in 11 ms. Remains 46 /51 variables (removed 5) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 46 cols
[2023-03-14 05:39:25] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 05:39:25] [INFO ] Invariant cache hit.
[2023-03-14 05:39:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 163 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/51 places, 62/67 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 33 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 28 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 28 transition count 40
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 24 transition count 32
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 24 transition count 32
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 20 transition count 28
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 20 transition count 28
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 16 transition count 20
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 16 transition count 20
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 12 transition count 16
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 12 transition count 16
Applied a total of 66 rules in 9 ms. Remains 12 /45 variables (removed 33) and now considering 16/62 (removed 46) transitions.
[2023-03-14 05:39:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-14 05:39:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 05:39:25] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-14 05:39:25] [INFO ] Invariant cache hit.
[2023-03-14 05:39:25] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/51 places, 16/67 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 12/51 places, 16/67 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-12 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U (p1||F(p2))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 67/67 transitions.
Graph (complete) has 153 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 50 transition count 64
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 48 transition count 64
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 46 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 46 transition count 62
Applied a total of 9 rules in 8 ms. Remains 46 /51 variables (removed 5) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 46 cols
[2023-03-14 05:39:25] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-14 05:39:25] [INFO ] Invariant cache hit.
[2023-03-14 05:39:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 187 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/51 places, 62/67 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 35 transition count 52
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 32 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 32 transition count 46
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 29 transition count 40
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 26 transition count 37
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 26 transition count 37
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 23 transition count 31
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 23 transition count 31
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 20 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 20 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 20 transition count 28
Applied a total of 51 rules in 22 ms. Remains 20 /45 variables (removed 25) and now considering 28/62 (removed 34) transitions.
[2023-03-14 05:39:25] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 20 cols
[2023-03-14 05:39:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-14 05:39:25] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2023-03-14 05:39:25] [INFO ] Invariant cache hit.
[2023-03-14 05:39:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-14 05:39:25] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/51 places, 28/67 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 334 ms. Remains : 20/51 places, 28/67 transitions.
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s13 1), p2:(AND (EQ s8 1) (EQ s19 1)), p0:(AND (EQ s12 1) (EQ s19 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-14 finished in 593 ms.
All properties solved by simple procedures.
Total runtime 10546 ms.
ITS solved all properties within timeout

BK_STOP 1678772366931

--------------------
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="DiscoveryGPU-PT-06a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DiscoveryGPU-PT-06a, 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 r137-smll-167819417900284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-PT-06a 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 ;