fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347200028
Last Updated
May 14, 2023

About the Execution of LTSMin+red for GPUForwardProgress-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
410.560 21399.00 40341.00 428.80 FFFTFFFTFFTFFFFT normal

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.r201-smll-167840347200028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is GPUForwardProgress-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347200028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 14:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 14:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 11K Feb 25 14:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 14:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 14:12 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 46K 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-08b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678517701161

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 06:55:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:55:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:55:04] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-11 06:55:04] [INFO ] Transformed 188 places.
[2023-03-11 06:55:04] [INFO ] Transformed 197 transitions.
[2023-03-11 06:55:04] [INFO ] Found NUPN structural information;
[2023-03-11 06:55:04] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 169 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 169 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 164 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 164 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 164 transition count 170
Applied a total of 51 rules in 61 ms. Remains 164 /188 variables (removed 24) and now considering 170/197 (removed 27) transitions.
// Phase 1: matrix 170 rows 164 cols
[2023-03-11 06:55:04] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-11 06:55:04] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-11 06:55:04] [INFO ] Invariant cache hit.
[2023-03-11 06:55:04] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-11 06:55:04] [INFO ] Invariant cache hit.
[2023-03-11 06:55:05] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/188 places, 170/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 ms. Remains : 164/188 places, 170/197 transitions.
Support contains 31 out of 164 places after structural reductions.
[2023-03-11 06:55:05] [INFO ] Flatten gal took : 57 ms
[2023-03-11 06:55:05] [INFO ] Flatten gal took : 24 ms
[2023-03-11 06:55:05] [INFO ] Input system was already deterministic with 170 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 27) seen :19
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-11 06:55:06] [INFO ] Invariant cache hit.
[2023-03-11 06:55:06] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-11 06:55:06] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2023-03-11 06:55:06] [INFO ] After 156ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 06:55:06] [INFO ] After 297ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:2
[2023-03-11 06:55:07] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-11 06:55:07] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-11 06:55:07] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-11 06:55:07] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 89 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=17 )
Parikh walk visited 3 properties in 10 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 31 stabilizing places and 31 stable transitions
Graph (complete) has 251 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 21 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-11 06:55:07] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 06:55:07] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 06:55:07] [INFO ] Invariant cache hit.
[2023-03-11 06:55:07] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-11 06:55:07] [INFO ] Invariant cache hit.
[2023-03-11 06:55:08] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s138 0), p0:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1294 reset in 359 ms.
Stack based approach found an accepted trace after 8708 steps with 113 reset with depth 143 and stack size 143 in 30 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-00 finished in 1104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(!p0)) U G(p1)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 138 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 75 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 73 transition count 83
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 152 place count 73 transition count 65
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 188 place count 55 transition count 65
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 197 place count 46 transition count 56
Iterating global reduction 4 with 9 rules applied. Total rules applied 206 place count 46 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 46 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 45 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 260 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 19 transition count 28
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 267 place count 13 transition count 17
Iterating global reduction 5 with 6 rules applied. Total rules applied 273 place count 13 transition count 17
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 275 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 15
Applied a total of 276 rules in 35 ms. Remains 11 /164 variables (removed 153) and now considering 15/170 (removed 155) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-11 06:55:08] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 06:55:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 06:55:08] [INFO ] Invariant cache hit.
[2023-03-11 06:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:55:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-11 06:55:08] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 06:55:08] [INFO ] Invariant cache hit.
[2023-03-11 06:55:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 15/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 11/164 places, 15/170 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(AND (EQ s4 1) (EQ s7 1)), p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], 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-08b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-01 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1&&X(p1))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 17 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-11 06:55:09] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:55:09] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 06:55:09] [INFO ] Invariant cache hit.
[2023-03-11 06:55:09] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 06:55:09] [INFO ] Invariant cache hit.
[2023-03-11 06:55:09] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(NEQ s33 1), p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24977 reset in 285 ms.
Product exploration explored 100000 steps with 25013 reset in 258 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 237 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 539 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 124 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:55:11] [INFO ] Invariant cache hit.
[2023-03-11 06:55:11] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-11 06:55:11] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-11 06:55:11] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-11 06:55:11] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 06:55:11] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 06:55:11] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 126 edges and 153 vertex of which 6 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 230 edges and 148 vertex of which 136 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 136 transition count 79
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 135 place count 71 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 70 transition count 78
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 136 place count 70 transition count 59
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 174 place count 51 transition count 59
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 183 place count 42 transition count 50
Iterating global reduction 3 with 9 rules applied. Total rules applied 192 place count 42 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 192 place count 42 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 41 transition count 49
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 244 place count 16 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 38 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 15 transition count 23
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 248 place count 15 transition count 21
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 254 place count 9 transition count 9
Iterating global reduction 5 with 6 rules applied. Total rules applied 260 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 265 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 8 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 267 place count 5 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 268 place count 5 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 269 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 270 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 3 transition count 3
Applied a total of 271 rules in 24 ms. Remains 3 /153 variables (removed 150) and now considering 3/156 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 3/153 places, 3/156 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 589 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 156/156 (removed 0) transitions.
[2023-03-11 06:55:12] [INFO ] Invariant cache hit.
[2023-03-11 06:55:12] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 06:55:12] [INFO ] Invariant cache hit.
[2023-03-11 06:55:12] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-11 06:55:12] [INFO ] Invariant cache hit.
[2023-03-11 06:55:12] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 153/153 places, 156/156 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 237 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Finished random walk after 2314 steps, including 27 resets, run visited all 3 properties in 50 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 24882 reset in 211 ms.
Product exploration explored 100000 steps with 25113 reset in 159 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Graph (trivial) has 126 edges and 153 vertex of which 6 / 153 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 231 edges and 148 vertex of which 136 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 136 transition count 147
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 67 place count 136 transition count 150
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 136 transition count 150
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 124 place count 90 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 170 place count 90 transition count 104
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 177 place count 83 transition count 97
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 184 place count 83 transition count 97
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 213 place count 83 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 215 place count 83 transition count 96
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 237 place count 61 transition count 73
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 259 place count 61 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 261 place count 60 transition count 72
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 72
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 270 place count 60 transition count 96
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 285 place count 45 transition count 66
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 300 place count 45 transition count 66
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 318 place count 27 transition count 36
Deduced a syphon composed of 18 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 336 place count 27 transition count 36
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 336 rules in 41 ms. Remains 27 /153 variables (removed 126) and now considering 36/156 (removed 120) transitions.
[2023-03-11 06:55:15] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 36 rows 27 cols
[2023-03-11 06:55:15] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-11 06:55:15] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/153 places, 36/156 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 27/153 places, 36/156 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 156/156 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 156/156 (removed 0) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-11 06:55:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:55:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 06:55:15] [INFO ] Invariant cache hit.
[2023-03-11 06:55:15] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-11 06:55:15] [INFO ] Invariant cache hit.
[2023-03-11 06:55:15] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 153/153 places, 156/156 transitions.
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 6590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G((p0||X(p0)))))&&F(p1)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 157 transition count 160
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 154 transition count 157
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 154 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 154 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 153 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Applied a total of 26 rules in 14 ms. Remains 153 /164 variables (removed 11) and now considering 155/170 (removed 15) transitions.
// Phase 1: matrix 155 rows 153 cols
[2023-03-11 06:55:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:55:15] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 06:55:15] [INFO ] Invariant cache hit.
[2023-03-11 06:55:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-11 06:55:15] [INFO ] Invariant cache hit.
[2023-03-11 06:55:15] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 153/164 places, 155/170 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s128 1), p0:(EQ s94 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-04 finished in 523 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))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 138 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 75 transition count 83
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 73 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 152 place count 73 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 190 place count 54 transition count 64
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 198 place count 46 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 206 place count 46 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 206 place count 46 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 208 place count 45 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 260 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 261 place count 19 transition count 28
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 267 place count 13 transition count 17
Iterating global reduction 5 with 6 rules applied. Total rules applied 273 place count 13 transition count 17
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 275 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 15
Applied a total of 276 rules in 23 ms. Remains 11 /164 variables (removed 153) and now considering 15/170 (removed 155) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-11 06:55:16] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 06:55:16] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-11 06:55:16] [INFO ] Invariant cache hit.
[2023-03-11 06:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:55:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-11 06:55:16] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 06:55:16] [INFO ] Invariant cache hit.
[2023-03-11 06:55:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 15/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 11/164 places, 15/170 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s4 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 104 steps with 7 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-05 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 157 transition count 163
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 157 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 157 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 154 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 153 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 153 transition count 156
Applied a total of 25 rules in 16 ms. Remains 153 /164 variables (removed 11) and now considering 156/170 (removed 14) transitions.
// Phase 1: matrix 156 rows 153 cols
[2023-03-11 06:55:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:55:16] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-11 06:55:16] [INFO ] Invariant cache hit.
[2023-03-11 06:55:16] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-11 06:55:16] [INFO ] Invariant cache hit.
[2023-03-11 06:55:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 156/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 153/164 places, 156/170 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s34 1), p1:(AND (EQ s81 1) (EQ s116 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]]
Product exploration explored 100000 steps with 1467 reset in 152 ms.
Stack based approach found an accepted trace after 61528 steps with 907 reset with depth 90 and stack size 90 in 79 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-06 finished in 1063 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 158 transition count 162
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 155 transition count 159
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 155 transition count 158
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 154 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 154 transition count 157
Applied a total of 23 rules in 10 ms. Remains 154 /164 variables (removed 10) and now considering 157/170 (removed 13) transitions.
// Phase 1: matrix 157 rows 154 cols
[2023-03-11 06:55:17] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 06:55:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-11 06:55:17] [INFO ] Invariant cache hit.
[2023-03-11 06:55:17] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-11 06:55:17] [INFO ] Invariant cache hit.
[2023-03-11 06:55:17] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 157/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 154/164 places, 157/170 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s92 0), p1:(EQ s87 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 238 edges and 154 vertex of which 142 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.4 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-07 finished in 996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 164
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 158 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 157 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 157 transition count 160
Applied a total of 17 rules in 9 ms. Remains 157 /164 variables (removed 7) and now considering 160/170 (removed 10) transitions.
// Phase 1: matrix 160 rows 157 cols
[2023-03-11 06:55:18] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 06:55:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 06:55:18] [INFO ] Invariant cache hit.
[2023-03-11 06:55:18] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-11 06:55:18] [INFO ] Invariant cache hit.
[2023-03-11 06:55:18] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/164 places, 160/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 157/164 places, 160/170 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s16 1), p1:(AND (OR (AND (EQ s133 0) (EQ s62 0)) (EQ s16 1)) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-08 finished in 524 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) U X(p0)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 136 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 146 transition count 92
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 75 rules applied. Total rules applied 145 place count 78 transition count 85
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 149 place count 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 74 transition count 84
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 150 place count 74 transition count 65
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 188 place count 55 transition count 65
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 195 place count 48 transition count 58
Iterating global reduction 4 with 7 rules applied. Total rules applied 202 place count 48 transition count 58
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 254 place count 22 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 255 place count 22 transition count 31
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 261 place count 16 transition count 20
Iterating global reduction 5 with 6 rules applied. Total rules applied 267 place count 16 transition count 20
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 5 with 4 rules applied. Total rules applied 271 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 272 place count 13 transition count 18
Applied a total of 272 rules in 25 ms. Remains 13 /164 variables (removed 151) and now considering 18/170 (removed 152) transitions.
[2023-03-11 06:55:18] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 13 cols
[2023-03-11 06:55:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 06:55:19] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-11 06:55:19] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 06:55:19] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/164 places, 18/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 13/164 places, 18/170 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s10 1) (EQ s12 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 5 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-09 finished in 176 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) U (p1&&G(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 139 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 146 transition count 90
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 76 transition count 83
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 73 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 154 place count 72 transition count 82
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 154 place count 72 transition count 63
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 192 place count 53 transition count 63
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 200 place count 45 transition count 55
Iterating global reduction 4 with 8 rules applied. Total rules applied 208 place count 45 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 208 place count 45 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 44 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 256 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 21 transition count 30
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 265 place count 13 transition count 15
Iterating global reduction 5 with 8 rules applied. Total rules applied 273 place count 13 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 275 place count 12 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 11 transition count 13
Applied a total of 276 rules in 20 ms. Remains 11 /164 variables (removed 153) and now considering 13/170 (removed 157) transitions.
// Phase 1: matrix 13 rows 11 cols
[2023-03-11 06:55:19] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-11 06:55:19] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/164 places, 13/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 11/164 places, 13/170 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s8 1), p0:(NEQ s1 1), p2:(EQ s5 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 7 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-11 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 156 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 153 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 152 transition count 154
Applied a total of 28 rules in 8 ms. Remains 152 /164 variables (removed 12) and now considering 154/170 (removed 16) transitions.
// Phase 1: matrix 154 rows 152 cols
[2023-03-11 06:55:19] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 152/164 places, 154/170 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s76 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 517 steps with 5 reset in 3 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-14 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p0||G(p1))))||(F((p0||G(p1)))&&F(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 162
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 156 transition count 159
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 153 transition count 156
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 153 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 153 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 152 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 152 transition count 154
Applied a total of 28 rules in 8 ms. Remains 152 /164 variables (removed 12) and now considering 154/170 (removed 16) transitions.
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:19] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-11 06:55:19] [INFO ] Invariant cache hit.
[2023-03-11 06:55:20] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-11 06:55:20] [INFO ] Invariant cache hit.
[2023-03-11 06:55:20] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/170 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 152/164 places, 154/170 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(NEQ s95 1), p1:(NEQ s30 1), p2:(NEQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 157 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-15 finished in 1206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((p1&&X(p1))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-08b-LTLFireability-02
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 170/170 transitions.
Graph (trivial) has 140 edges and 164 vertex of which 6 / 164 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 245 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 146 transition count 89
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 76 rules applied. Total rules applied 149 place count 75 transition count 84
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 73 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 72 transition count 83
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 153 place count 72 transition count 64
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 191 place count 53 transition count 64
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 199 place count 45 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 207 place count 45 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 207 place count 45 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 44 transition count 55
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 261 place count 18 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 18 transition count 28
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 269 place count 11 transition count 15
Iterating global reduction 5 with 7 rules applied. Total rules applied 276 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 5 with 4 rules applied. Total rules applied 280 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 281 place count 8 transition count 13
Applied a total of 281 rules in 27 ms. Remains 8 /164 variables (removed 156) and now considering 13/170 (removed 157) transitions.
// Phase 1: matrix 13 rows 8 cols
[2023-03-11 06:55:21] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 06:55:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 06:55:21] [INFO ] Invariant cache hit.
[2023-03-11 06:55:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 06:55:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-11 06:55:21] [INFO ] Invariant cache hit.
[2023-03-11 06:55:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/164 places, 13/170 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 109 ms. Remains : 8/164 places, 13/170 transitions.
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(NEQ s4 1), p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 40 steps with 12 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-08b-LTLFireability-02 finished in 374 ms.
FORMULA GPUForwardProgress-PT-08b-LTLFireability-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-11 06:55:21] [INFO ] Flatten gal took : 14 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 17612 ms.
ITS solved all properties within timeout

BK_STOP 1678517722560

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-08b, 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 r201-smll-167840347200028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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