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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 13:33 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 24K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 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 25K 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-07a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678314932301

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-07a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 22:35:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 22:35:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 22:35:35] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-08 22:35:35] [INFO ] Transformed 73 places.
[2023-03-08 22:35:35] [INFO ] Transformed 99 transitions.
[2023-03-08 22:35:35] [INFO ] Found NUPN structural information;
[2023-03-08 22:35:35] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 247 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 3 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 68 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 68 transition count 94
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 17 place count 68 transition count 87
Applied a total of 17 rules in 29 ms. Remains 68 /73 variables (removed 5) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 68 cols
[2023-03-08 22:35:36] [INFO ] Computed 2 place invariants in 9 ms
[2023-03-08 22:35:36] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-08 22:35:36] [INFO ] Invariant cache hit.
[2023-03-08 22:35:36] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 22:35:36] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2023-03-08 22:35:36] [INFO ] Invariant cache hit.
[2023-03-08 22:35:37] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/73 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 68/73 places, 87/99 transitions.
Support contains 22 out of 68 places after structural reductions.
[2023-03-08 22:35:37] [INFO ] Flatten gal took : 56 ms
[2023-03-08 22:35:37] [INFO ] Flatten gal took : 25 ms
[2023-03-08 22:35:37] [INFO ] Input system was already deterministic with 87 transitions.
Support contains 20 out of 68 places (down from 22) after GAL structural reductions.
Finished random walk after 639 steps, including 8 resets, run visited all 22 properties in 195 ms. (steps per millisecond=3 )
Computed a total of 10 stabilizing places and 8 stable transitions
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 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||G((p1||X(p0)))))||(p2&&(!p0||G((p1||X(p0)))))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 56 transition count 75
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 56 transition count 75
Applied a total of 24 rules in 18 ms. Remains 56 /68 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 56 cols
[2023-03-08 22:35:38] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 22:35:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 22:35:38] [INFO ] Invariant cache hit.
[2023-03-08 22:35:38] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:38] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 320 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 75/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 343 ms. Remains : 55/68 places, 75/87 transitions.
Stuttering acceptance computed with spot in 513 ms :[true, false, false, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s48 1) (EQ s54 1)), p2:(NEQ s49 1), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 731 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 147 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-07a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-01 finished in 2372 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 65 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 71 edges and 62 vertex of which 52 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Graph (trivial) has 58 edges and 52 vertex of which 28 / 52 are part of one of the 14 SCC in 4 ms
Free SCC test removed 14 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 38 transition count 65
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 35 place count 30 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 25 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 25 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 50 place count 20 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 20 transition count 31
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 15 transition count 21
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 15 transition count 21
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 10 transition count 16
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 10 transition count 16
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 79 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 6 transition count 11
Applied a total of 82 rules in 29 ms. Remains 6 /68 variables (removed 62) and now considering 11/87 (removed 76) transitions.
[2023-03-08 22:35:40] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2023-03-08 22:35:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 22:35:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 22:35:40] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-08 22:35:40] [INFO ] Invariant cache hit.
[2023-03-08 22:35:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-08 22:35:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:35:40] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2023-03-08 22:35:40] [INFO ] Invariant cache hit.
[2023-03-08 22:35:40] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/68 places, 11/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 6/68 places, 11/87 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-02 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 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-02 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 58 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 58 transition count 77
Applied a total of 20 rules in 11 ms. Remains 58 /68 variables (removed 10) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 58 cols
[2023-03-08 22:35:40] [INFO ] Computed 2 place invariants in 16 ms
[2023-03-08 22:35:40] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 22:35:40] [INFO ] Invariant cache hit.
[2023-03-08 22:35:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 361 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/68 places, 77/87 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 378 ms. Remains : 57/68 places, 77/87 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s32 0)], 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 146 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-03 finished in 526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 70 edges and 61 vertex of which 49 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Graph (trivial) has 54 edges and 49 vertex of which 26 / 49 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 36 transition count 63
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 32 place count 29 transition count 50
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 24 transition count 40
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 24 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 19 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 19 transition count 30
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 14 transition count 20
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 14 transition count 20
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 9 transition count 15
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 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 76 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 77 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 79 place count 5 transition count 10
Applied a total of 79 rules in 19 ms. Remains 5 /68 variables (removed 63) and now considering 10/87 (removed 77) transitions.
[2023-03-08 22:35:41] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2023-03-08 22:35:41] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 22:35:41] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 22:35:41] [INFO ] Invariant cache hit.
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-08 22:35:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:35:41] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2023-03-08 22:35:41] [INFO ] Invariant cache hit.
[2023-03-08 22:35:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/68 places, 10/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 5/68 places, 10/87 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-04 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 64 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 60 transition count 79
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 55 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 55 transition count 74
Applied a total of 19 rules in 21 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2023-03-08 22:35:41] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 22:35:41] [INFO ] Invariant cache hit.
[2023-03-08 22:35:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants and state equation in 163 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 241 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/68 places, 74/87 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 40 transition count 60
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 35 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 35 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 30 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 30 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 25 transition count 35
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 25 transition count 35
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 20 transition count 25
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 20 transition count 25
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 73 place count 15 transition count 20
Iterating global reduction 0 with 5 rules applied. Total rules applied 78 place count 15 transition count 20
Applied a total of 78 rules in 22 ms. Remains 15 /54 variables (removed 39) and now considering 20/74 (removed 54) transitions.
[2023-03-08 22:35:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2023-03-08 22:35:41] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 22:35:41] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2023-03-08 22:35:41] [INFO ] Invariant cache hit.
[2023-03-08 22:35:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-08 22:35:41] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/68 places, 20/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 386 ms. Remains : 15/68 places, 20/87 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-05 finished in 463 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1&&G(p0)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 58 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 58 transition count 77
Applied a total of 20 rules in 12 ms. Remains 58 /68 variables (removed 10) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 58 cols
[2023-03-08 22:35:41] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 22:35:42] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 22:35:42] [INFO ] Invariant cache hit.
[2023-03-08 22:35:42] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 22:35:42] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/68 places, 77/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 268 ms. Remains : 57/68 places, 77/87 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s40 1) (EQ s56 1)), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][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-07a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-06 finished in 537 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((p0&&F(G(p1))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 10 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2023-03-08 22:35:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 22:35:42] [INFO ] Invariant cache hit.
[2023-03-08 22:35:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:42] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 22:35:42] [INFO ] Invariant cache hit.
[2023-03-08 22:35:42] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 74/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 55/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s28 1) (EQ s53 1)) (AND (EQ s11 1) (EQ s54 1))), p1:(AND (EQ s11 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-07 finished in 580 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||X(X(p1))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 7 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
[2023-03-08 22:35:43] [INFO ] Invariant cache hit.
[2023-03-08 22:35:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 22:35:43] [INFO ] Invariant cache hit.
[2023-03-08 22:35:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:43] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 256 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/68 places, 74/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 266 ms. Remains : 54/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 0), p1:(AND (OR (EQ s0 0) (EQ s8 0)) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1323 reset in 458 ms.
Product exploration explored 100000 steps with 1330 reset in 343 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/54 stabilizing places and 8/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 390 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 54 cols
[2023-03-08 22:35:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 22:35:45] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 22:35:45] [INFO ] Invariant cache hit.
[2023-03-08 22:35:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 22:35:46] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-08 22:35:46] [INFO ] Invariant cache hit.
[2023-03-08 22:35:46] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 54/54 places, 74/74 transitions.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/54 stabilizing places and 8/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 265 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 1334 reset in 177 ms.
Product exploration explored 100000 steps with 1336 reset in 398 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 74/74 transitions.
Graph (complete) has 146 edges and 54 vertex of which 53 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 53 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 73
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 0 with 13 rules applied. Total rules applied 15 place count 53 transition count 86
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 47 transition count 74
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 47 transition count 74
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 39 place count 35 transition count 50
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 51 place count 35 transition count 50
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 57 place count 29 transition count 44
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 63 place count 29 transition count 44
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 68 place count 24 transition count 34
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 73 place count 24 transition count 34
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 83 place count 14 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 93 place count 14 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 93 rules in 15 ms. Remains 14 /54 variables (removed 40) and now considering 19/74 (removed 55) transitions.
[2023-03-08 22:35:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 22:35:48] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 14 cols
[2023-03-08 22:35:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 22:35:48] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/54 places, 19/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 14/54 places, 19/74 transitions.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 54 cols
[2023-03-08 22:35:48] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-08 22:35:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 22:35:48] [INFO ] Invariant cache hit.
[2023-03-08 22:35:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 22:35:48] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-08 22:35:48] [INFO ] Invariant cache hit.
[2023-03-08 22:35:48] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 54/54 places, 74/74 transitions.
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-08 finished in 5854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 57 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 57 transition count 76
Applied a total of 22 rules in 4 ms. Remains 57 /68 variables (removed 11) and now considering 76/87 (removed 11) transitions.
// Phase 1: matrix 76 rows 57 cols
[2023-03-08 22:35:48] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:49] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 22:35:49] [INFO ] Invariant cache hit.
[2023-03-08 22:35:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 22:35:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 220 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/68 places, 76/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 56/68 places, 76/87 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 173 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-10 finished in 357 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&&G((F(p1)&&F(G(p2)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 60 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 60 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 58 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 58 transition count 77
Applied a total of 20 rules in 6 ms. Remains 58 /68 variables (removed 10) and now considering 77/87 (removed 10) transitions.
// Phase 1: matrix 77 rows 58 cols
[2023-03-08 22:35:49] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:49] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 22:35:49] [INFO ] Invariant cache hit.
[2023-03-08 22:35:49] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 22:35:49] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 227 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/68 places, 77/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 235 ms. Remains : 57/68 places, 77/87 transitions.
Stuttering acceptance computed with spot in 335 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-07a-LTLFireability-12 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:(OR (EQ s51 0) (EQ s56 0)), p1:(EQ s18 0), p2:(EQ s37 0)], 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]]
Product exploration explored 100000 steps with 1338 reset in 188 ms.
Stack based approach found an accepted trace after 803 steps with 10 reset with depth 34 and stack size 33 in 5 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-12 finished in 796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Graph (complete) has 193 edges and 68 vertex of which 64 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 64 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 60 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 15 place count 54 transition count 73
Iterating global reduction 0 with 6 rules applied. Total rules applied 21 place count 54 transition count 73
Applied a total of 21 rules in 14 ms. Remains 54 /68 variables (removed 14) and now considering 73/87 (removed 14) transitions.
// Phase 1: matrix 73 rows 54 cols
[2023-03-08 22:35:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:50] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 22:35:50] [INFO ] Invariant cache hit.
[2023-03-08 22:35:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:50] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 22:35:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 22:35:50] [INFO ] Invariant cache hit.
[2023-03-08 22:35:50] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/68 places, 73/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 54/68 places, 73/87 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s47 0), p0:(AND (EQ s23 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1533 reset in 199 ms.
Stack based approach found an accepted trace after 72 steps with 1 reset with depth 38 and stack size 36 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-13 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 63 transition count 82
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 63 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 59 transition count 78
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 59 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 56 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 56 transition count 75
Applied a total of 24 rules in 6 ms. Remains 56 /68 variables (removed 12) and now considering 75/87 (removed 12) transitions.
// Phase 1: matrix 75 rows 56 cols
[2023-03-08 22:35:50] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:50] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 22:35:50] [INFO ] Invariant cache hit.
[2023-03-08 22:35:50] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:51] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 75/87 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 55/68 places, 75/87 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s39 0)], 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 120 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-14 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 87/87 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 81
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 58 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 58 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 55 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 55 transition count 74
Applied a total of 26 rules in 6 ms. Remains 55 /68 variables (removed 13) and now considering 74/87 (removed 13) transitions.
// Phase 1: matrix 74 rows 55 cols
[2023-03-08 22:35:51] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 22:35:51] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 22:35:51] [INFO ] Invariant cache hit.
[2023-03-08 22:35:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 22:35:51] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 22:35:51] [INFO ] Invariant cache hit.
[2023-03-08 22:35:51] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 55/68 places, 74/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 55/68 places, 74/87 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s39 1), p1:(AND (EQ s25 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 103 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLFireability-15 finished in 483 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||X(X(p1))))))'
[2023-03-08 22:35:51] [INFO ] Flatten gal took : 14 ms
[2023-03-08 22:35:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 22:35:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 87 transitions and 279 arcs took 2 ms.
Total runtime 16069 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DiscoveryGPU-PT-07a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

BK_STOP 1678314993333

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DiscoveryGPU-PT-07a-LTLFireability-08
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 5/32 DiscoveryGPU-PT-07a-LTLFireability-08 753280 m, 150656 m/sec, 5376785 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 10/32 DiscoveryGPU-PT-07a-LTLFireability-08 1390848 m, 127513 m/sec, 10412410 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 14/32 DiscoveryGPU-PT-07a-LTLFireability-08 2046494 m, 131129 m/sec, 15850351 t fired, .

Time elapsed: 15 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 18/32 DiscoveryGPU-PT-07a-LTLFireability-08 2710924 m, 132886 m/sec, 21229684 t fired, .

Time elapsed: 20 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 22/32 DiscoveryGPU-PT-07a-LTLFireability-08 3332097 m, 124234 m/sec, 26439760 t fired, .

Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 27/32 DiscoveryGPU-PT-07a-LTLFireability-08 4000378 m, 133656 m/sec, 32030090 t fired, .

Time elapsed: 30 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 30/32 DiscoveryGPU-PT-07a-LTLFireability-08 4592453 m, 118415 m/sec, 37457969 t fired, .

Time elapsed: 35 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for DiscoveryGPU-PT-07a-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DiscoveryGPU-PT-07a-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DiscoveryGPU-PT-07a-LTLFireability-08: LTL unknown AGGR


Time elapsed: 40 secs. Pages in use: 32

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-07a"
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-07a, 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-167819414000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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