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.r295-tall-167873947700340.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 Planning-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947700340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 5 18:23 unfinite

--------------------
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 Planning-PT-none-LTLFireability-00
FORMULA_NAME Planning-PT-none-LTLFireability-01
FORMULA_NAME Planning-PT-none-LTLFireability-02
FORMULA_NAME Planning-PT-none-LTLFireability-03
FORMULA_NAME Planning-PT-none-LTLFireability-04
FORMULA_NAME Planning-PT-none-LTLFireability-05
FORMULA_NAME Planning-PT-none-LTLFireability-06
FORMULA_NAME Planning-PT-none-LTLFireability-07
FORMULA_NAME Planning-PT-none-LTLFireability-08
FORMULA_NAME Planning-PT-none-LTLFireability-09
FORMULA_NAME Planning-PT-none-LTLFireability-10
FORMULA_NAME Planning-PT-none-LTLFireability-11
FORMULA_NAME Planning-PT-none-LTLFireability-12
FORMULA_NAME Planning-PT-none-LTLFireability-13
FORMULA_NAME Planning-PT-none-LTLFireability-14
FORMULA_NAME Planning-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678828006984

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=Planning-PT-none
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 21:06:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 21:06:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 21:06:48] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-14 21:06:48] [INFO ] Transformed 126 places.
[2023-03-14 21:06:48] [INFO ] Transformed 128 transitions.
[2023-03-14 21:06:48] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA Planning-PT-none-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 98 transition count 123
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 42 place count 87 transition count 112
Iterating global reduction 1 with 11 rules applied. Total rules applied 53 place count 87 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 85 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 85 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 59 place count 85 transition count 106
Applied a total of 59 rules in 32 ms. Remains 85 /124 variables (removed 39) and now considering 106/128 (removed 22) transitions.
[2023-03-14 21:06:49] [INFO ] Flow matrix only has 82 transitions (discarded 24 similar events)
// Phase 1: matrix 82 rows 85 cols
[2023-03-14 21:06:49] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-14 21:06:49] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-14 21:06:49] [INFO ] Flow matrix only has 82 transitions (discarded 24 similar events)
[2023-03-14 21:06:49] [INFO ] Invariant cache hit.
[2023-03-14 21:06:49] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-14 21:06:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
[2023-03-14 21:06:49] [INFO ] Flow matrix only has 82 transitions (discarded 24 similar events)
[2023-03-14 21:06:49] [INFO ] Invariant cache hit.
[2023-03-14 21:06:49] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/124 places, 106/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 584 ms. Remains : 85/124 places, 106/128 transitions.
Support contains 33 out of 85 places after structural reductions.
[2023-03-14 21:06:49] [INFO ] Flatten gal took : 27 ms
[2023-03-14 21:06:49] [INFO ] Flatten gal took : 13 ms
[2023-03-14 21:06:49] [INFO ] Input system was already deterministic with 106 transitions.
Support contains 32 out of 85 places (down from 33) after GAL structural reductions.
Finished random walk after 973 steps, including 0 resets, run visited all 22 properties in 74 ms. (steps per millisecond=13 )
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 428 edges and 85 vertex of which 80 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(!p1&&F(!p0)&&F(G(!p2))))))'
Support contains 11 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Graph (trivial) has 27 edges and 85 vertex of which 22 / 85 are part of one of the 11 SCC in 2 ms
Free SCC test removed 11 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 412 edges and 74 vertex of which 69 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 57 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 57 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 57 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 30 place count 47 transition count 72
Applied a total of 30 rules in 19 ms. Remains 47 /85 variables (removed 38) and now considering 72/106 (removed 34) transitions.
[2023-03-14 21:06:49] [INFO ] Flow matrix only has 46 transitions (discarded 26 similar events)
// Phase 1: matrix 46 rows 47 cols
[2023-03-14 21:06:49] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 21:06:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 21:06:50] [INFO ] Flow matrix only has 46 transitions (discarded 26 similar events)
[2023-03-14 21:06:50] [INFO ] Invariant cache hit.
[2023-03-14 21:06:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:50] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-14 21:06:50] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-14 21:06:50] [INFO ] Flow matrix only has 46 transitions (discarded 26 similar events)
[2023-03-14 21:06:50] [INFO ] Invariant cache hit.
[2023-03-14 21:06:50] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/85 places, 72/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 47/85 places, 72/106 transitions.
Stuttering acceptance computed with spot in 280 ms :[p0, (AND p0 p2), p0, (AND p0 p2)]
Running random walk in product with property : Planning-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s15 1) (GEQ s23 1) (GEQ s36 1)), p0:(OR (AND (GEQ s4 1) (GEQ s14 1) (GEQ s43 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s23 1) (GEQ s36 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 182 steps with 0 reset in 6 ms.
FORMULA Planning-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-01 finished in 584 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||X((p1||X(p2)))))))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 82 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 80 transition count 97
Applied a total of 12 rules in 10 ms. Remains 80 /85 variables (removed 5) and now considering 97/106 (removed 9) transitions.
[2023-03-14 21:06:50] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2023-03-14 21:06:50] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-14 21:06:50] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-14 21:06:50] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2023-03-14 21:06:50] [INFO ] Invariant cache hit.
[2023-03-14 21:06:50] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 21:06:50] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-14 21:06:50] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2023-03-14 21:06:50] [INFO ] Invariant cache hit.
[2023-03-14 21:06:50] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 97/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 80/85 places, 97/106 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Planning-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s46 1) (GEQ s56 1) (GEQ s67 1)), p1:(LT s3 1), p2:(OR (LT s33 1) (LT s40 1) (LT s57 1) (LT s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 343 ms.
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 398 edges and 80 vertex of which 78 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Planning-PT-none-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Planning-PT-none-LTLFireability-04 finished in 1061 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 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 81 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 81 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 78 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 78 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 78 transition count 79
Applied a total of 17 rules in 11 ms. Remains 78 /85 variables (removed 7) and now considering 79/106 (removed 27) transitions.
[2023-03-14 21:06:51] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 78 cols
[2023-03-14 21:06:51] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-14 21:06:51] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-14 21:06:51] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-14 21:06:51] [INFO ] Invariant cache hit.
[2023-03-14 21:06:51] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:51] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-14 21:06:51] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-14 21:06:51] [INFO ] Invariant cache hit.
[2023-03-14 21:06:51] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/85 places, 79/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 78/85 places, 79/106 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-06 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:(AND (GEQ s0 1) (GEQ s65 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 1018 reset in 309 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Planning-PT-none-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-06 finished in 634 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 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Graph (trivial) has 31 edges and 85 vertex of which 26 / 85 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 407 edges and 72 vertex of which 67 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 54 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 51 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 51 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 51 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 38 place count 41 transition count 48
Applied a total of 38 rules in 17 ms. Remains 41 /85 variables (removed 44) and now considering 48/106 (removed 58) transitions.
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
// Phase 1: matrix 40 rows 41 cols
[2023-03-14 21:06:52] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-14 21:06:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2023-03-14 21:06:52] [INFO ] Invariant cache hit.
[2023-03-14 21:06:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:52] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-14 21:06:52] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 40 transitions (discarded 8 similar events)
[2023-03-14 21:06:52] [INFO ] Invariant cache hit.
[2023-03-14 21:06:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/85 places, 48/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 41/85 places, 48/106 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-07 finished in 286 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||(F(p1)&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 82 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 103
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 80 transition count 99
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 80 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 80 transition count 97
Applied a total of 12 rules in 14 ms. Remains 80 /85 variables (removed 5) and now considering 97/106 (removed 9) transitions.
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
// Phase 1: matrix 74 rows 80 cols
[2023-03-14 21:06:52] [INFO ] Computed 37 place invariants in 7 ms
[2023-03-14 21:06:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2023-03-14 21:06:52] [INFO ] Invariant cache hit.
[2023-03-14 21:06:52] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 21:06:52] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-14 21:06:52] [INFO ] Flow matrix only has 74 transitions (discarded 23 similar events)
[2023-03-14 21:06:52] [INFO ] Invariant cache hit.
[2023-03-14 21:06:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/85 places, 97/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 80/85 places, 97/106 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, p0, true]
Running random walk in product with property : Planning-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s68 1), p1:(AND (GEQ s14 1) (GEQ s37 1) (GEQ s55 1) (GEQ s75 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]]
Product exploration explored 100000 steps with 625 reset in 304 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA Planning-PT-none-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-08 finished in 750 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))&&(F(G(p2))||p1))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 81 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 81 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 78 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 78 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 78 transition count 79
Applied a total of 17 rules in 9 ms. Remains 78 /85 variables (removed 7) and now considering 79/106 (removed 27) transitions.
[2023-03-14 21:06:53] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 78 cols
[2023-03-14 21:06:53] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-14 21:06:53] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-14 21:06:53] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-14 21:06:53] [INFO ] Invariant cache hit.
[2023-03-14 21:06:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:53] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-14 21:06:53] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-14 21:06:53] [INFO ] Invariant cache hit.
[2023-03-14 21:06:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/85 places, 79/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 78/85 places, 79/106 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : Planning-PT-none-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s73 1) (LT s39 1)), p0:(AND (GEQ s0 1) (GEQ s73 1)), p2:(LT s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Stack based approach found an accepted trace after 110 steps with 0 reset with depth 111 and stack size 111 in 2 ms.
FORMULA Planning-PT-none-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Planning-PT-none-LTLFireability-10 finished in 656 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)&&F(p1))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Graph (trivial) has 33 edges and 85 vertex of which 28 / 85 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 406 edges and 71 vertex of which 67 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 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 53 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 52 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 52 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 52 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 33 place count 42 transition count 67
Applied a total of 33 rules in 11 ms. Remains 42 /85 variables (removed 43) and now considering 67/106 (removed 39) transitions.
[2023-03-14 21:06:53] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
// Phase 1: matrix 42 rows 42 cols
[2023-03-14 21:06:53] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-14 21:06:53] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 21:06:53] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
[2023-03-14 21:06:53] [INFO ] Invariant cache hit.
[2023-03-14 21:06:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 21:06:54] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-14 21:06:54] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 42 transitions (discarded 25 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:54] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/85 places, 67/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 42/85 places, 67/106 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Planning-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s28 1)) (LT s2 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Planning-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-11 finished in 338 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)||(F(G(p2))&&p1))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 82 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 82 transition count 103
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 81 transition count 101
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 81 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 81 transition count 100
Applied a total of 9 rules in 5 ms. Remains 81 /85 variables (removed 4) and now considering 100/106 (removed 6) transitions.
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
// Phase 1: matrix 75 rows 81 cols
[2023-03-14 21:06:54] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-14 21:06:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 21:06:54] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 75 transitions (discarded 25 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:54] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/85 places, 100/106 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 81/85 places, 100/106 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Planning-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s72 1), p1:(AND (GEQ s11 1) (GEQ s39 1) (GEQ s55 1) (GEQ s71 1)), p2:(AND (GEQ s1 1) (GEQ s59 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, 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 Planning-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-12 finished in 393 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(G(p1))||G(!p2))&&p0))))'
Support contains 8 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Graph (trivial) has 31 edges and 85 vertex of which 26 / 85 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 408 edges and 72 vertex of which 67 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 54 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 52 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 52 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 52 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 35 place count 42 transition count 65
Applied a total of 35 rules in 10 ms. Remains 42 /85 variables (removed 43) and now considering 65/106 (removed 41) transitions.
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
// Phase 1: matrix 41 rows 42 cols
[2023-03-14 21:06:54] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-14 21:06:54] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-14 21:06:54] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/85 places, 65/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 42/85 places, 65/106 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2))]
Running random walk in product with property : Planning-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={2} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 2} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NOT (AND (GEQ s8 1) (GEQ s14 1) (GEQ s19 1) (GEQ s37 1))) (OR (AND (GEQ s3 1) (GEQ s14 1) (GEQ s18 1) (GEQ s37 1)) (AND (GEQ s1 1) (GEQ s25 1))))...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 392 steps with 0 reset in 5 ms.
FORMULA Planning-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-13 finished in 346 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 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 106/106 transitions.
Graph (trivial) has 31 edges and 85 vertex of which 26 / 85 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 408 edges and 72 vertex of which 67 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 54 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 52 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 52 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 52 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 35 place count 42 transition count 65
Applied a total of 35 rules in 11 ms. Remains 42 /85 variables (removed 43) and now considering 65/106 (removed 41) transitions.
[2023-03-14 21:06:54] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2023-03-14 21:06:54] [INFO ] Invariant cache hit.
[2023-03-14 21:06:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 21:06:55] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2023-03-14 21:06:55] [INFO ] Invariant cache hit.
[2023-03-14 21:06:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-14 21:06:55] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-14 21:06:55] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-14 21:06:55] [INFO ] Flow matrix only has 41 transitions (discarded 24 similar events)
[2023-03-14 21:06:55] [INFO ] Invariant cache hit.
[2023-03-14 21:06:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/85 places, 65/106 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 42/85 places, 65/106 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Planning-PT-none-LTLFireability-15 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:(AND (GEQ s6 1) (GEQ s14 1) (GEQ s19 1) (GEQ s33 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 Planning-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Planning-PT-none-LTLFireability-15 finished in 248 ms.
All properties solved by simple procedures.
Total runtime 6768 ms.
ITS solved all properties within timeout

BK_STOP 1678828016241

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Planning-PT-none"
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 Planning-PT-none, 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 r295-tall-167873947700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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