Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151400258.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DiscoveryGPU-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 01:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421104067

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-09a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:38:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:38:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:38:25] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2024-05-22 23:38:25] [INFO ] Transformed 93 places.
[2024-05-22 23:38:25] [INFO ] Transformed 127 transitions.
[2024-05-22 23:38:25] [INFO ] Found NUPN structural information;
[2024-05-22 23:38:25] [INFO ] Parsed PT model containing 93 places and 127 transitions and 408 arcs in 106 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 85 transition count 119
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 85 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 80 transition count 114
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 80 transition count 114
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 35 place count 80 transition count 105
Applied a total of 35 rules in 27 ms. Remains 80 /93 variables (removed 13) and now considering 105/127 (removed 22) transitions.
// Phase 1: matrix 105 rows 80 cols
[2024-05-22 23:38:26] [INFO ] Computed 2 invariants in 13 ms
[2024-05-22 23:38:26] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 23:38:26] [INFO ] Invariant cache hit.
[2024-05-22 23:38:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-22 23:38:26] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-22 23:38:26] [INFO ] Invariant cache hit.
[2024-05-22 23:38:26] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/93 places, 105/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 427 ms. Remains : 80/93 places, 105/127 transitions.
Support contains 24 out of 80 places after structural reductions.
[2024-05-22 23:38:26] [INFO ] Flatten gal took : 32 ms
[2024-05-22 23:38:26] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:38:26] [INFO ] Input system was already deterministic with 105 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:38:26] [INFO ] Invariant cache hit.
[2024-05-22 23:38:26] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-22 23:38:26] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 10 stable transitions
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 72 transition count 97
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 69 transition count 94
Applied a total of 22 rules in 7 ms. Remains 69 /80 variables (removed 11) and now considering 94/105 (removed 11) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 23:38:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:38:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 23:38:27] [INFO ] Invariant cache hit.
[2024-05-22 23:38:27] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:38:27] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 171 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/80 places, 94/105 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 68/80 places, 94/105 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 302 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-00 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:(NEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 252 steps with 2 reset in 6 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-00 finished in 540 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 79 transition count 100
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 75 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 17 place count 67 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 25 place count 67 transition count 92
Applied a total of 25 rules in 21 ms. Remains 67 /80 variables (removed 13) and now considering 92/105 (removed 13) transitions.
// Phase 1: matrix 92 rows 67 cols
[2024-05-22 23:38:27] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 23:38:27] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 23:38:27] [INFO ] Invariant cache hit.
[2024-05-22 23:38:27] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:38:27] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/80 places, 92/105 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 49 transition count 75
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 41 transition count 59
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 41 transition count 59
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 33 transition count 43
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 33 transition count 43
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 26 transition count 36
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 26 transition count 36
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 87 place count 19 transition count 22
Iterating global reduction 0 with 7 rules applied. Total rules applied 94 place count 19 transition count 22
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 12 transition count 15
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 12 transition count 15
Applied a total of 109 rules in 12 ms. Remains 12 /66 variables (removed 54) and now considering 15/92 (removed 77) transitions.
[2024-05-22 23:38:28] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2024-05-22 23:38:28] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:38:28] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
[2024-05-22 23:38:28] [INFO ] Invariant cache hit.
[2024-05-22 23:38:28] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/80 places, 15/105 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 12/80 places, 15/105 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s11 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-01 finished in 298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||X(X(p1))) U G(!p2)))'
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 transition count 96
Applied a total of 18 rules in 9 ms. Remains 71 /80 variables (removed 9) and now considering 96/105 (removed 9) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 23:38:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 23:38:28] [INFO ] Invariant cache hit.
[2024-05-22 23:38:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 96/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 70/80 places, 96/105 transitions.
Stuttering acceptance computed with spot in 288 ms :[p2, (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s45 1) (EQ s69 1)), p0:(AND (EQ s35 1) (EQ s69 1)), p1:(AND (EQ s53 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2500 steps with 27 reset in 22 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-03 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||G(p1)))||(X(X(p0))&&F(p2))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 75 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 75 transition count 100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 73 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 73 transition count 98
Applied a total of 14 rules in 5 ms. Remains 73 /80 variables (removed 7) and now considering 98/105 (removed 7) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-22 23:38:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 23:38:28] [INFO ] Invariant cache hit.
[2024-05-22 23:38:28] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 23:38:28] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-22 23:38:28] [INFO ] Invariant cache hit.
[2024-05-22 23:38:28] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 98/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 73/80 places, 98/105 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 5}, { cond=p1, acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s20 1) (EQ s72 1)), p1:(AND (EQ s11 1) (EQ s71 1)), p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-04 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||G(p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 71 transition count 96
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 71 transition count 96
Applied a total of 18 rules in 6 ms. Remains 71 /80 variables (removed 9) and now considering 96/105 (removed 9) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-22 23:38:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:38:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 23:38:29] [INFO ] Invariant cache hit.
[2024-05-22 23:38:29] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-05-22 23:38:29] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 96/105 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 70/80 places, 96/105 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s53 1) (EQ s69 1)), p1:(OR (EQ s53 0) (EQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1160 reset in 229 ms.
Product exploration explored 100000 steps with 1156 reset in 312 ms.
Computed a total of 11 stabilizing places and 10 stable transitions
Graph (complete) has 189 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 11 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 102 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 96 rows 70 cols
[2024-05-22 23:38:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:38:30] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:38:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 23:38:30] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-09a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-09 finished in 1449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||(p0&&G(!p1)))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 79 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 77 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 12 place count 70 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 19 place count 70 transition count 95
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 0 with 2 rules applied. Total rules applied 21 place count 69 transition count 94
Applied a total of 21 rules in 16 ms. Remains 69 /80 variables (removed 11) and now considering 94/105 (removed 11) transitions.
// Phase 1: matrix 94 rows 69 cols
[2024-05-22 23:38:30] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 23:38:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 23:38:30] [INFO ] Invariant cache hit.
[2024-05-22 23:38:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:38:30] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-22 23:38:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:38:30] [INFO ] Invariant cache hit.
[2024-05-22 23:38:30] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/80 places, 94/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 249 ms. Remains : 69/80 places, 94/105 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s68 1)), p0:(NEQ s9 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1126 reset in 186 ms.
Stack based approach found an accepted trace after 1458 steps with 16 reset with depth 71 and stack size 70 in 2 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-10 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0 U (p1||G(!p0)))||(p2&&G(p3))))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 79 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 76 transition count 101
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 14 place count 69 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 21 place count 69 transition count 94
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 0 with 2 rules applied. Total rules applied 23 place count 68 transition count 93
Applied a total of 23 rules in 10 ms. Remains 68 /80 variables (removed 12) and now considering 93/105 (removed 12) transitions.
// Phase 1: matrix 93 rows 68 cols
[2024-05-22 23:38:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:38:31] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:38:31] [INFO ] Invariant cache hit.
[2024-05-22 23:38:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:38:31] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-22 23:38:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:38:31] [INFO ] Invariant cache hit.
[2024-05-22 23:38:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/80 places, 93/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 68/80 places, 93/105 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p3))), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p3) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) (NOT p1) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s54 0) (EQ s66 0)), p1:(AND (NOT (AND (EQ s54 1) (EQ s66 1))) (NOT (AND (EQ s58 1) (EQ s67 1)))), p3:(AND (EQ s48 1) (EQ s67 1)), p0:(AND (EQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1920 reset in 188 ms.
Stack based approach found an accepted trace after 161 steps with 1 reset with depth 78 and stack size 76 in 4 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-11 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!p0||G(p1))) U G(p2))))'
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 74 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 74 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 73 transition count 98
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 73 transition count 98
Applied a total of 14 rules in 3 ms. Remains 73 /80 variables (removed 7) and now considering 98/105 (removed 7) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-22 23:38:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:38:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:38:31] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-22 23:38:32] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-22 23:38:32] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 73/80 places, 98/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 73/80 places, 98/105 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s32 1) (EQ s71 1)), p0:(AND (EQ s55 1) (EQ s71 1)), p1:(AND (EQ s45 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-12 finished in 342 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(p0))||(p1&&X(G((p1||G(p2)))))))))'
Support contains 3 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 73 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 70 transition count 95
Applied a total of 20 rules in 6 ms. Remains 70 /80 variables (removed 10) and now considering 95/105 (removed 10) transitions.
// Phase 1: matrix 95 rows 70 cols
[2024-05-22 23:38:32] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:38:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 23:38:32] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-22 23:38:32] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 23:38:32] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/80 places, 95/105 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 70/80 places, 95/105 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s3 1), p0:(AND (EQ s32 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-13 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 105/105 transitions.
Graph (complete) has 238 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 90 edges and 76 vertex of which 63 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Graph (trivial) has 68 edges and 63 vertex of which 34 / 63 are part of one of the 17 SCC in 3 ms
Free SCC test removed 17 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 46 transition count 82
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 38 place count 38 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 45 place count 31 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 52 place count 31 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 25 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 25 transition count 39
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 19 transition count 27
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 19 transition count 27
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 13 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 13 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 11 transition count 19
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 11 transition count 17
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 8 transition count 14
Applied a total of 97 rules in 30 ms. Remains 8 /80 variables (removed 72) and now considering 14/105 (removed 91) transitions.
[2024-05-22 23:38:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 8 cols
[2024-05-22 23:38:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 23:38:32] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 23:38:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:38:32] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-22 23:38:32] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:38:32] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
[2024-05-22 23:38:32] [INFO ] Invariant cache hit.
[2024-05-22 23:38:32] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/80 places, 14/105 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 8/80 places, 14/105 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 0), p1:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-LTLFireability-14 finished in 305 ms.
All properties solved by simple procedures.
Total runtime 7366 ms.

BK_STOP 1716421113953

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DiscoveryGPU-PT-09a, 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 r153-tall-171631151400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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