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.r197-smll-167840343600012.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 itstools
Input is GPUForwardProgress-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343600012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 27K 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 GPUForwardProgress-PT-04b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678464115900

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 16:01:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 16:01:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:01:59] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-10 16:01:59] [INFO ] Transformed 112 places.
[2023-03-10 16:01:59] [INFO ] Transformed 117 transitions.
[2023-03-10 16:01:59] [INFO ] Found NUPN structural information;
[2023-03-10 16:01:59] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 98 transition count 104
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 98 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 93 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 93 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 93 transition count 97
Applied a total of 39 rules in 53 ms. Remains 93 /112 variables (removed 19) and now considering 97/117 (removed 20) transitions.
// Phase 1: matrix 97 rows 93 cols
[2023-03-10 16:01:59] [INFO ] Computed 5 place invariants in 12 ms
[2023-03-10 16:02:00] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-10 16:02:00] [INFO ] Invariant cache hit.
[2023-03-10 16:02:00] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-10 16:02:00] [INFO ] Invariant cache hit.
[2023-03-10 16:02:00] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/112 places, 97/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 93/112 places, 97/117 transitions.
Support contains 29 out of 93 places after structural reductions.
[2023-03-10 16:02:00] [INFO ] Flatten gal took : 61 ms
[2023-03-10 16:02:00] [INFO ] Flatten gal took : 21 ms
[2023-03-10 16:02:01] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 28 out of 93 places (down from 29) after GAL structural reductions.
Finished random walk after 6444 steps, including 137 resets, run visited all 27 properties in 431 ms. (steps per millisecond=14 )
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 142 edges and 93 vertex of which 85 are kept as prefixes of interest. Removing 8 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(p0))'
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 80 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 79 transition count 51
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 43 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 75 place count 43 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 31 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 103 place count 27 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 107 place count 27 transition count 34
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 133 place count 14 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 11 transition count 15
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 8 transition count 13
Applied a total of 147 rules in 42 ms. Remains 8 /93 variables (removed 85) and now considering 13/97 (removed 84) transitions.
[2023-03-10 16:02:02] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 16:02:02] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-10 16:02:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 16:02:02] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:02:02] [INFO ] Invariant cache hit.
[2023-03-10 16:02:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-10 16:02:02] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-10 16:02:02] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:02:02] [INFO ] Invariant cache hit.
[2023-03-10 16:02:02] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/93 places, 13/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 8/93 places, 13/97 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 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 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-00 finished in 541 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)||X(p1)))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 93
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 89 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 88 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 88 transition count 90
Applied a total of 12 rules in 33 ms. Remains 88 /93 variables (removed 5) and now considering 90/97 (removed 7) transitions.
// Phase 1: matrix 90 rows 88 cols
[2023-03-10 16:02:02] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-10 16:02:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-10 16:02:02] [INFO ] Invariant cache hit.
[2023-03-10 16:02:02] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-10 16:02:02] [INFO ] Invariant cache hit.
[2023-03-10 16:02:02] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/93 places, 90/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 484 ms. Remains : 88/93 places, 90/97 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s10 1) (EQ s75 1) (EQ s86 1)), p0:(OR (EQ s10 0) (EQ s75 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3030 steps with 65 reset in 56 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-01 finished in 780 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 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 80 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 79 transition count 52
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 44 transition count 49
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 42 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 41 transition count 47
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 80 place count 41 transition count 36
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 102 place count 30 transition count 36
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 26 transition count 32
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 26 transition count 32
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 4 with 28 rules applied. Total rules applied 138 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 12 transition count 17
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 142 place count 9 transition count 12
Iterating global reduction 5 with 3 rules applied. Total rules applied 145 place count 9 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 7 transition count 10
Applied a total of 148 rules in 23 ms. Remains 7 /93 variables (removed 86) and now considering 10/97 (removed 87) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-10 16:02:03] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:02:03] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-10 16:02:03] [INFO ] Invariant cache hit.
[2023-03-10 16:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:03] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 16:02:03] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 16:02:03] [INFO ] Invariant cache hit.
[2023-03-10 16:02:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/93 places, 10/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 7/93 places, 10/97 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 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 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-02 finished in 214 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 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 77 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 79 transition count 53
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 45 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 44 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 74 place count 44 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 98 place count 32 transition count 38
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 28 transition count 34
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 28 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 130 place count 16 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 16 transition count 21
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 13 transition count 16
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 13 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 11 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 10 transition count 14
Applied a total of 142 rules in 19 ms. Remains 10 /93 variables (removed 83) and now considering 14/97 (removed 83) transitions.
[2023-03-10 16:02:03] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-10 16:02:03] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:02:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 16:02:03] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-10 16:02:03] [INFO ] Invariant cache hit.
[2023-03-10 16:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:03] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 16:02:03] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-10 16:02:03] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-10 16:02:03] [INFO ] Invariant cache hit.
[2023-03-10 16:02:03] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/93 places, 14/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 10/93 places, 14/97 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-03 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:(OR (EQ s3 0) (EQ s7 0) (EQ s9 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10079 reset in 505 ms.
Product exploration explored 100000 steps with 10309 reset in 340 ms.
Computed a total of 5 stabilizing places and 8 stable transitions
Computed a total of 5 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 14/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2023-03-10 16:02:05] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-10 16:02:05] [INFO ] Invariant cache hit.
[2023-03-10 16:02:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 16:02:05] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-10 16:02:05] [INFO ] Invariant cache hit.
[2023-03-10 16:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-10 16:02:05] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 16:02:05] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
[2023-03-10 16:02:05] [INFO ] Invariant cache hit.
[2023-03-10 16:02:05] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 10/10 places, 14/14 transitions.
Computed a total of 5 stabilizing places and 8 stable transitions
Computed a total of 5 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10184 reset in 229 ms.
Product exploration explored 100000 steps with 10091 reset in 316 ms.
Built C files in :
/tmp/ltsmin10923367699663290178
[2023-03-10 16:02:06] [INFO ] Computing symmetric may disable matrix : 14 transitions.
[2023-03-10 16:02:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:06] [INFO ] Computing symmetric may enable matrix : 14 transitions.
[2023-03-10 16:02:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:06] [INFO ] Computing Do-Not-Accords matrix : 14 transitions.
[2023-03-10 16:02:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10923367699663290178
Running compilation step : cd /tmp/ltsmin10923367699663290178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin10923367699663290178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin10923367699663290178;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15212912236156387121.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-03 finished in 3873 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 G(p1)))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 78 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 81 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 80 transition count 53
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 45 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 44 transition count 49
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 80 place count 42 transition count 48
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 80 place count 42 transition count 37
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 102 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 27 transition count 33
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 27 transition count 33
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 136 place count 14 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 14 transition count 19
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 11 transition count 14
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 10 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 10 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 9 transition count 12
Applied a total of 147 rules in 30 ms. Remains 9 /93 variables (removed 84) and now considering 12/97 (removed 85) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-10 16:02:07] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:02:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-10 16:02:07] [INFO ] Invariant cache hit.
[2023-03-10 16:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:07] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-10 16:02:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 16:02:07] [INFO ] Invariant cache hit.
[2023-03-10 16:02:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/93 places, 12/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 9/93 places, 12/97 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s7 1), p0:(NEQ s3 1)], 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 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-04 finished in 341 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 U (p1||G(p0))))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 89 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 89 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 89 transition count 91
Applied a total of 10 rules in 18 ms. Remains 89 /93 variables (removed 4) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 89 cols
[2023-03-10 16:02:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-10 16:02:07] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-10 16:02:07] [INFO ] Invariant cache hit.
[2023-03-10 16:02:07] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-10 16:02:07] [INFO ] Invariant cache hit.
[2023-03-10 16:02:07] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/93 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 89/93 places, 91/97 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (NEQ s46 1) (EQ s69 1)), p0:(OR (EQ s69 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-06 finished in 410 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)||F((p1||X(p2)))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 89 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 89 transition count 93
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 89 transition count 92
Applied a total of 9 rules in 9 ms. Remains 89 /93 variables (removed 4) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 89 cols
[2023-03-10 16:02:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:02:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-10 16:02:08] [INFO ] Invariant cache hit.
[2023-03-10 16:02:08] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-10 16:02:08] [INFO ] Invariant cache hit.
[2023-03-10 16:02:08] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/93 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 89/93 places, 92/97 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s33 1), p2:(NEQ s52 1), p0:(OR (EQ s29 0) (EQ s76 0) (EQ s87 0))], 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 50000 reset in 236 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Graph (complete) has 137 edges and 89 vertex of which 81 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Computed a total of 15 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-04b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-07 finished in 1029 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 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 79 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 79 transition count 52
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 44 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 43 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 42 transition count 48
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 78 place count 42 transition count 36
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 102 place count 30 transition count 36
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 26 transition count 32
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 26 transition count 32
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 136 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 13 transition count 18
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 140 place count 10 transition count 13
Iterating global reduction 5 with 3 rules applied. Total rules applied 143 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 8 transition count 11
Applied a total of 146 rules in 16 ms. Remains 8 /93 variables (removed 85) and now considering 11/97 (removed 86) transitions.
// Phase 1: matrix 11 rows 8 cols
[2023-03-10 16:02:09] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 16:02:09] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/93 places, 11/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 8/93 places, 11/97 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 1)], 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 49 steps with 10 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-08 finished in 169 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((X(G((p1 U p2)))&&p0))))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 93
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 89 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 88 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 88 transition count 90
Applied a total of 12 rules in 5 ms. Remains 88 /93 variables (removed 5) and now considering 90/97 (removed 7) transitions.
// Phase 1: matrix 90 rows 88 cols
[2023-03-10 16:02:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/93 places, 90/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 88/93 places, 90/97 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s75 1) (EQ s86 1)), p2:(EQ s30 1), p1:(NEQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-09 finished in 515 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(p1))&&p0)))'
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 89 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 89 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 89 transition count 91
Applied a total of 10 rules in 8 ms. Remains 89 /93 variables (removed 4) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 89 cols
[2023-03-10 16:02:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:09] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-10 16:02:09] [INFO ] Invariant cache hit.
[2023-03-10 16:02:10] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/93 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 89/93 places, 91/97 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s76 1) (EQ s87 1)), p1:(EQ s69 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-10 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 80 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 79 transition count 53
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 45 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 44 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 43 transition count 49
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 76 place count 43 transition count 37
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 100 place count 31 transition count 37
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 104 place count 27 transition count 33
Iterating global reduction 4 with 4 rules applied. Total rules applied 108 place count 27 transition count 33
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 132 place count 15 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 15 transition count 20
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 136 place count 12 transition count 15
Iterating global reduction 5 with 3 rules applied. Total rules applied 139 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 141 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 10 transition count 13
Applied a total of 142 rules in 17 ms. Remains 10 /93 variables (removed 83) and now considering 13/97 (removed 84) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-10 16:02:10] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:02:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 16:02:10] [INFO ] Invariant cache hit.
[2023-03-10 16:02:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:02:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 16:02:10] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-10 16:02:10] [INFO ] Invariant cache hit.
[2023-03-10 16:02:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/93 places, 13/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 10/93 places, 13/97 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s5 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-11 finished in 240 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))&&(X(p1)||(G(p2)&&X(X(G(p0)))))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 90 transition count 93
Applied a total of 7 rules in 4 ms. Remains 90 /93 variables (removed 3) and now considering 93/97 (removed 4) transitions.
// Phase 1: matrix 93 rows 90 cols
[2023-03-10 16:02:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:02:10] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-10 16:02:10] [INFO ] Invariant cache hit.
[2023-03-10 16:02:10] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-10 16:02:10] [INFO ] Invariant cache hit.
[2023-03-10 16:02:10] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/93 places, 93/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 90/93 places, 93/97 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p0), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s36 1), p2:(EQ s58 1), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-12 finished in 789 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)||(p0&&G(F(p1))))))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Graph (trivial) has 79 edges and 93 vertex of which 6 / 93 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 136 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 79 transition count 52
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 44 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 43 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 42 transition count 48
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 78 place count 42 transition count 38
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 98 place count 32 transition count 38
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 29 transition count 35
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 29 transition count 35
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 134 place count 14 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 14 transition count 19
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 138 place count 11 transition count 14
Iterating global reduction 5 with 3 rules applied. Total rules applied 141 place count 11 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 10 transition count 13
Applied a total of 143 rules in 15 ms. Remains 10 /93 variables (removed 83) and now considering 13/97 (removed 84) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-10 16:02:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:02:11] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 16:02:11] [INFO ] Invariant cache hit.
[2023-03-10 16:02:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 16:02:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-10 16:02:11] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 16:02:11] [INFO ] Invariant cache hit.
[2023-03-10 16:02:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/93 places, 13/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 10/93 places, 13/97 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s5 1), p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 12110 reset in 417 ms.
Product exploration explored 100000 steps with 11926 reset in 315 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/10 stabilizing places and 4/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 7 factoid took 422 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 p1) p0), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 518 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2023-03-10 16:02:13] [INFO ] Invariant cache hit.
[2023-03-10 16:02:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 16:02:13] [INFO ] Invariant cache hit.
[2023-03-10 16:02:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-10 16:02:13] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-10 16:02:13] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-10 16:02:13] [INFO ] Invariant cache hit.
[2023-03-10 16:02:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 10/10 places, 13/13 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/10 stabilizing places and 4/13 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 340 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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 p1) p0), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 493 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 11920 reset in 145 ms.
Product exploration explored 100000 steps with 11893 reset in 174 ms.
Built C files in :
/tmp/ltsmin10553807960244254399
[2023-03-10 16:02:15] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2023-03-10 16:02:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:15] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2023-03-10 16:02:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:15] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2023-03-10 16:02:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-10 16:02:15] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10553807960244254399
Running compilation step : cd /tmp/ltsmin10553807960244254399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 165 ms.
Running link step : cd /tmp/ltsmin10553807960244254399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10553807960244254399;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15275710677034753863.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-13 finished in 4899 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 U !p1) U X((F(!p1) U p2))))))'
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 89 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 89 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 89 transition count 91
Applied a total of 10 rules in 6 ms. Remains 89 /93 variables (removed 4) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 89 cols
[2023-03-10 16:02:16] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 16:02:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-10 16:02:16] [INFO ] Invariant cache hit.
[2023-03-10 16:02:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-10 16:02:16] [INFO ] Invariant cache hit.
[2023-03-10 16:02:16] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/93 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 89/93 places, 91/97 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND p1 (NOT p2)), p1]
Running random walk in product with property : GPUForwardProgress-PT-04b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s65 1), p0:(AND (NEQ s85 1) (EQ s65 1)), p2:(EQ s42 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-LTLFireability-15 finished in 785 ms.
All properties solved by simple procedures.
Total runtime 17683 ms.

BK_STOP 1678464137994

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="GPUForwardProgress-PT-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is GPUForwardProgress-PT-04b, 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 r197-smll-167840343600012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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