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.r135-smll-167819414200380.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 DiscoveryGPU-PT-12a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414200380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 13:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:29 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.6K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 13:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 43K 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-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678324415874

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=DiscoveryGPU-PT-12a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 01:13:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 01:13:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 01:13:38] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-09 01:13:38] [INFO ] Transformed 123 places.
[2023-03-09 01:13:38] [INFO ] Transformed 169 transitions.
[2023-03-09 01:13:38] [INFO ] Found NUPN structural information;
[2023-03-09 01:13:38] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 158
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 106 transition count 152
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 106 transition count 152
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 102 transition count 144
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 102 transition count 144
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 102 transition count 136
Applied a total of 50 rules in 54 ms. Remains 102 /123 variables (removed 21) and now considering 136/169 (removed 33) transitions.
// Phase 1: matrix 136 rows 102 cols
[2023-03-09 01:13:39] [INFO ] Computed 2 place invariants in 11 ms
[2023-03-09 01:13:39] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-09 01:13:39] [INFO ] Invariant cache hit.
[2023-03-09 01:13:39] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-09 01:13:40] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-09 01:13:40] [INFO ] Invariant cache hit.
[2023-03-09 01:13:40] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/123 places, 136/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 102/123 places, 136/169 transitions.
Support contains 31 out of 102 places after structural reductions.
[2023-03-09 01:13:40] [INFO ] Flatten gal took : 45 ms
[2023-03-09 01:13:40] [INFO ] Flatten gal took : 21 ms
[2023-03-09 01:13:40] [INFO ] Input system was already deterministic with 136 transitions.
Support contains 29 out of 102 places (down from 31) after GAL structural reductions.
Finished random walk after 3921 steps, including 30 resets, run visited all 24 properties in 197 ms. (steps per millisecond=19 )
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 309 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 90 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 90 transition count 124
Applied a total of 24 rules in 15 ms. Remains 90 /102 variables (removed 12) and now considering 124/136 (removed 12) transitions.
// Phase 1: matrix 124 rows 90 cols
[2023-03-09 01:13:41] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-09 01:13:41] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 01:13:41] [INFO ] Invariant cache hit.
[2023-03-09 01:13:41] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:41] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 273 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 124/136 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 292 ms. Remains : 89/102 places, 124/136 transitions.
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s29 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 3510 reset in 394 ms.
Stack based approach found an accepted trace after 102 steps with 2 reset with depth 21 and stack size 21 in 5 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-00 finished in 1046 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||X(p0))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 309 edges and 102 vertex of which 101 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 101 transition count 129
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 88 transition count 122
Applied a total of 27 rules in 28 ms. Remains 88 /102 variables (removed 14) and now considering 122/136 (removed 14) transitions.
// Phase 1: matrix 122 rows 88 cols
[2023-03-09 01:13:42] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-09 01:13:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-09 01:13:42] [INFO ] Invariant cache hit.
[2023-03-09 01:13:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:42] [INFO ] Implicit Places using invariants and state equation in 211 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 297 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 122/136 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 54 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 54 transition count 79
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 44 transition count 59
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 44 transition count 59
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 34 transition count 49
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 34 transition count 49
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 24 transition count 29
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 24 transition count 29
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 14 transition count 19
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 14 transition count 19
Applied a total of 147 rules in 32 ms. Remains 14 /87 variables (removed 73) and now considering 19/122 (removed 103) transitions.
[2023-03-09 01:13:42] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2023-03-09 01:13:42] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 01:13:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 01:13:42] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-09 01:13:42] [INFO ] Invariant cache hit.
[2023-03-09 01:13:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 01:13:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/102 places, 19/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 14/102 places, 19/136 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s13 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 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-01 finished in 482 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 309 edges and 102 vertex of which 101 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 101 transition count 130
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 91 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 91 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 90 transition count 124
Applied a total of 23 rules in 28 ms. Remains 90 /102 variables (removed 12) and now considering 124/136 (removed 12) transitions.
// Phase 1: matrix 124 rows 90 cols
[2023-03-09 01:13:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-09 01:13:42] [INFO ] Invariant cache hit.
[2023-03-09 01:13:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:43] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-09 01:13:43] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 01:13:43] [INFO ] Invariant cache hit.
[2023-03-09 01:13:43] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/102 places, 124/136 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 90/102 places, 124/136 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s52 1) (AND (EQ s44 1) (EQ s89 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 629 steps with 6 reset in 5 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-02 finished in 476 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(G(!p0)) U p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 90 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 90 transition count 124
Applied a total of 24 rules in 7 ms. Remains 90 /102 variables (removed 12) and now considering 124/136 (removed 12) transitions.
// Phase 1: matrix 124 rows 90 cols
[2023-03-09 01:13:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 01:13:43] [INFO ] Invariant cache hit.
[2023-03-09 01:13:43] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:43] [INFO ] Implicit Places using invariants and state equation in 196 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 274 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/102 places, 124/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 284 ms. Remains : 89/102 places, 124/136 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s88 1)), p0:(AND (EQ s37 1) (EQ s88 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 831 reset in 221 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-04 finished in 659 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((F(p1)&&F(G(p2))))&&p0)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 4 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2023-03-09 01:13:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:43] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 01:13:43] [INFO ] Invariant cache hit.
[2023-03-09 01:13:44] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-09 01:13:44] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 208 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 216 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s90 1)), p1:(AND (EQ s81 1) (EQ s90 1)), p2:(AND (EQ s26 1) (EQ s90 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-05 finished in 546 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)||G(p1))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 309 edges and 102 vertex of which 101 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 101 transition count 129
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 88 transition count 122
Applied a total of 27 rules in 14 ms. Remains 88 /102 variables (removed 14) and now considering 122/136 (removed 14) transitions.
// Phase 1: matrix 122 rows 88 cols
[2023-03-09 01:13:44] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-09 01:13:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 01:13:44] [INFO ] Invariant cache hit.
[2023-03-09 01:13:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:44] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 122/136 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 42 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 42 transition count 55
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 32 transition count 45
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 32 transition count 45
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 22 transition count 25
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 22 transition count 25
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 13 transition count 16
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 13 transition count 16
Applied a total of 149 rules in 15 ms. Remains 13 /87 variables (removed 74) and now considering 16/122 (removed 106) transitions.
[2023-03-09 01:13:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2023-03-09 01:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 01:13:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-09 01:13:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 01:13:44] [INFO ] Invariant cache hit.
[2023-03-09 01:13:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-09 01:13:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/102 places, 16/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 13/102 places, 16/136 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s12 1)), p1:(OR (EQ s11 0) (EQ s12 0) (AND (EQ s4 1) (EQ s12 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1288 reset in 412 ms.
Product exploration explored 100000 steps with 1292 reset in 265 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/13 stabilizing places and 13/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 468 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 146 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 01:13:46] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2023-03-09 01:13:46] [INFO ] Invariant cache hit.
[2023-03-09 01:13:46] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 01:13:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-09 01:13:46] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 10 factoid took 487 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 2144 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) U p1))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 309 edges and 102 vertex of which 101 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 101 transition count 129
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 88 transition count 122
Applied a total of 27 rules in 19 ms. Remains 88 /102 variables (removed 14) and now considering 122/136 (removed 14) transitions.
// Phase 1: matrix 122 rows 88 cols
[2023-03-09 01:13:46] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 01:13:46] [INFO ] Invariant cache hit.
[2023-03-09 01:13:46] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:46] [INFO ] Implicit Places using invariants and state equation in 157 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 225 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 122/136 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 66 transition count 101
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 56 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 56 transition count 81
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 46 transition count 61
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 46 transition count 61
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 92 place count 36 transition count 51
Iterating global reduction 0 with 10 rules applied. Total rules applied 102 place count 36 transition count 51
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 28 transition count 35
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 28 transition count 35
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 20 transition count 27
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 20 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 136 place count 20 transition count 27
Applied a total of 136 rules in 21 ms. Remains 20 /87 variables (removed 67) and now considering 27/122 (removed 95) transitions.
[2023-03-09 01:13:46] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 20 cols
[2023-03-09 01:13:46] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 01:13:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 01:13:46] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2023-03-09 01:13:46] [INFO ] Invariant cache hit.
[2023-03-09 01:13:46] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 01:13:46] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/102 places, 27/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 20/102 places, 27/136 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), p0]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s6 1) (EQ s19 1)), p0:(AND (EQ s14 1) (EQ s19 1))], nbAcceptance=0, 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 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 finished in 442 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((F(G(p1))&&p0))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 4 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2023-03-09 01:13:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 01:13:47] [INFO ] Invariant cache hit.
[2023-03-09 01:13:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-09 01:13:47] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 236 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 0 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s39 0) (EQ s90 0)) (OR (EQ s79 0) (EQ s90 0))), p1:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 784 reset in 159 ms.
Stack based approach found an accepted trace after 69 steps with 0 reset with depth 70 and stack size 67 in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-08 finished in 632 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 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Graph (complete) has 309 edges and 102 vertex of which 101 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 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 101 transition count 129
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 95 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 20 place count 88 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 27 place count 88 transition count 122
Applied a total of 27 rules in 13 ms. Remains 88 /102 variables (removed 14) and now considering 122/136 (removed 14) transitions.
// Phase 1: matrix 122 rows 88 cols
[2023-03-09 01:13:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-09 01:13:47] [INFO ] Invariant cache hit.
[2023-03-09 01:13:47] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:47] [INFO ] Implicit Places using invariants and state equation in 164 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 230 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/102 places, 122/136 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 65 transition count 100
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 53 place count 56 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 62 place count 56 transition count 82
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 71 place count 47 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 80 place count 47 transition count 64
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 38 transition count 55
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 38 transition count 55
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 29 transition count 37
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 29 transition count 37
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 125 place count 20 transition count 28
Iterating global reduction 0 with 9 rules applied. Total rules applied 134 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 135 place count 20 transition count 28
Applied a total of 135 rules in 15 ms. Remains 20 /87 variables (removed 67) and now considering 28/122 (removed 94) transitions.
[2023-03-09 01:13:47] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 20 cols
[2023-03-09 01:13:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 01:13:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 01:13:47] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
[2023-03-09 01:13:47] [INFO ] Invariant cache hit.
[2023-03-09 01:13:48] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-09 01:13:48] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/102 places, 28/136 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 20/102 places, 28/136 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09 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:(AND (EQ s3 1) (EQ s19 1)), p0:(EQ s13 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 434 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((F(p1)&&p0))))'
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 4 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2023-03-09 01:13:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-09 01:13:48] [INFO ] Invariant cache hit.
[2023-03-09 01:13:48] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-09 01:13:48] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 237 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 242 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s90 1) (EQ s29 1)), p1:(AND (EQ s16 1) (EQ s90 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 402 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&&(p1||G(p2)))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 91 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 91 transition count 125
Applied a total of 22 rules in 4 ms. Remains 91 /102 variables (removed 11) and now considering 125/136 (removed 11) transitions.
// Phase 1: matrix 125 rows 91 cols
[2023-03-09 01:13:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 01:13:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 01:13:48] [INFO ] Invariant cache hit.
[2023-03-09 01:13:48] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:48] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-09 01:13:48] [INFO ] Invariant cache hit.
[2023-03-09 01:13:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 125/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 91/102 places, 125/136 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (EQ s73 1) (EQ s89 1)), p0:(OR (EQ s52 0) (EQ s89 0)), p1:(AND (EQ s53 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-13 finished in 435 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(p0) U p1))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 96 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 96 transition count 130
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 92 transition count 126
Applied a total of 20 rules in 3 ms. Remains 92 /102 variables (removed 10) and now considering 126/136 (removed 10) transitions.
// Phase 1: matrix 126 rows 92 cols
[2023-03-09 01:13:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 01:13:49] [INFO ] Invariant cache hit.
[2023-03-09 01:13:49] [INFO ] State equation strengthened by 86 read => feed constraints.
[2023-03-09 01:13:49] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 126/136 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 195 ms. Remains : 91/102 places, 126/136 transitions.
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-14 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=(OR p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s34 1) (OR (EQ s62 1) (AND (EQ s18 1) (EQ s90 1)))), p0:(AND (EQ s39 1) (EQ s90 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-14 finished in 543 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(G(p0))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 136/136 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 95 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 90 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 90 transition count 124
Applied a total of 24 rules in 4 ms. Remains 90 /102 variables (removed 12) and now considering 124/136 (removed 12) transitions.
// Phase 1: matrix 124 rows 90 cols
[2023-03-09 01:13:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 01:13:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-09 01:13:49] [INFO ] Invariant cache hit.
[2023-03-09 01:13:49] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 01:13:49] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-09 01:13:49] [INFO ] Invariant cache hit.
[2023-03-09 01:13:49] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 124/136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 90/102 places, 124/136 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s32 1) (EQ s46 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-15 finished in 385 ms.
All properties solved by simple procedures.
Total runtime 11190 ms.
ITS solved all properties within timeout

BK_STOP 1678324430941

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-12a"
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 DiscoveryGPU-PT-12a, 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 r135-smll-167819414200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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