fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r153-tall-171631151400248
Last Updated
July 7, 2024

About the Execution of 2023-gold for DiscoveryGPU-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
343.592 8217.00 14588.00 393.20 FFFFFFFFFFTFTFFT normal

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-171631151400248.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-08a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151400248
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 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 28K 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-08a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421014069

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-08a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:36:55] [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:36:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:36:55] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-22 23:36:55] [INFO ] Transformed 83 places.
[2024-05-22 23:36:55] [INFO ] Transformed 113 transitions.
[2024-05-22 23:36:55] [INFO ] Found NUPN structural information;
[2024-05-22 23:36:55] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 102
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 69 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 69 transition count 96
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 33 place count 69 transition count 91
Applied a total of 33 rules in 21 ms. Remains 69 /83 variables (removed 14) and now considering 91/113 (removed 22) transitions.
// Phase 1: matrix 91 rows 69 cols
[2024-05-22 23:36:56] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 23:36:56] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-22 23:36:56] [INFO ] Invariant cache hit.
[2024-05-22 23:36:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/83 places, 91/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 69/83 places, 91/113 transitions.
Support contains 23 out of 69 places after structural reductions.
[2024-05-22 23:36:56] [INFO ] Flatten gal took : 25 ms
[2024-05-22 23:36:56] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:36:56] [INFO ] Input system was already deterministic with 91 transitions.
Support contains 22 out of 69 places (down from 23) after GAL structural reductions.
Finished random walk after 308 steps, including 3 resets, run visited all 23 properties in 27 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 206 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 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 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 84
Applied a total of 14 rules in 8 ms. Remains 62 /69 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:36:57] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 23:36:57] [INFO ] Invariant cache hit.
[2024-05-22 23:36:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 84/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 61/69 places, 84/91 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 184 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-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:(AND (EQ s9 1) (EQ 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 1 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-00 finished in 372 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((X(G(p0)) U (X(X(p2))&&p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 84
Applied a total of 14 rules in 11 ms. Remains 62 /69 variables (removed 7) and now considering 84/91 (removed 7) transitions.
[2024-05-22 23:36:57] [INFO ] Invariant cache hit.
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:36:57] [INFO ] Invariant cache hit.
[2024-05-22 23:36:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:57] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 84/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 61/69 places, 84/91 transitions.
Stuttering acceptance computed with spot in 537 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}, { cond=(NOT p1), acceptance={0} source=3 dest: 7}, { cond=p1, acceptance={0} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s48 1) (EQ s60 1)), p0:(AND (EQ s48 1) (EQ s60 1)), p2:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-02 finished in 716 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(p0)||X((p1 U p2))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 66 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 85
Applied a total of 12 rules in 11 ms. Remains 63 /69 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 23:36:58] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 85/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 62/69 places, 85/91 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(EQ s22 1), p1:(EQ s53 1), p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-03 finished in 348 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 p2))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 66 transition count 88
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 66 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 85
Applied a total of 12 rules in 9 ms. Remains 63 /69 variables (removed 6) and now considering 85/91 (removed 6) transitions.
// Phase 1: matrix 85 rows 63 cols
[2024-05-22 23:36:58] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:58] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-22 23:36:58] [INFO ] Invariant cache hit.
[2024-05-22 23:36:58] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 85/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 63/69 places, 85/91 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s27 1) (EQ s61 1)), p2:(AND (EQ s51 1) (EQ s62 1)), p1:(AND (EQ s39 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5504 reset in 281 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-04 finished in 615 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(G(p0))&&G(p1))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 84
Applied a total of 14 rules in 5 ms. Remains 62 /69 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:36:59] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:36:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 84/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 61/69 places, 84/91 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s34 1) (EQ s60 1)), p0:(OR (EQ s31 0) (EQ s60 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-05 finished in 275 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(G((p0||F(p1))))&&F((p2||G(p3))))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Graph (complete) has 206 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 67 transition count 87
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 65 transition count 87
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 9 place count 61 transition count 83
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 61 transition count 83
Applied a total of 13 rules in 18 ms. Remains 61 /69 variables (removed 8) and now considering 83/91 (removed 8) transitions.
// Phase 1: matrix 83 rows 61 cols
[2024-05-22 23:36:59] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:36:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-22 23:36:59] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:36:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/69 places, 83/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 61/69 places, 83/91 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s6 1), p3:(EQ s6 0), p0:(EQ s24 0), p1:(OR (EQ s9 0) (EQ s60 0))], nbAcceptance=1, 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 1276 reset in 195 ms.
Stack based approach found an accepted trace after 6138 steps with 79 reset with depth 57 and stack size 54 in 11 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-07 finished in 519 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(G(p0))) U (p1||X(!p0))))'
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 62 transition count 84
Applied a total of 14 rules in 8 ms. Remains 62 /69 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 62 cols
[2024-05-22 23:36:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 23:36:59] [INFO ] Invariant cache hit.
[2024-05-22 23:36:59] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:36:59] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/69 places, 84/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 61/69 places, 84/91 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s11 1), p0:(NEQ s57 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-09 finished in 285 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||X((p1 U (G(p1)||(p1&&(!p0 U (p2||G(!p0)))))))))))'
Support contains 2 out of 69 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 90
Applied a total of 2 rules in 3 ms. Remains 68 /69 variables (removed 1) and now considering 90/91 (removed 1) transitions.
// Phase 1: matrix 90 rows 68 cols
[2024-05-22 23:37:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:37:00] [INFO ] Invariant cache hit.
[2024-05-22 23:37:00] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 90/91 transitions.
Applied a total of 0 rules in 0 ms. Remains 67 /67 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 67/69 places, 90/91 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s58 1), p1:(NEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 135 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 174 edges and 67 vertex of which 65 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-10 finished in 527 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Graph (complete) has 206 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 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 67 transition count 86
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 86
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 60 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 60 transition count 82
Applied a total of 15 rules in 11 ms. Remains 60 /69 variables (removed 9) and now considering 82/91 (removed 9) transitions.
// Phase 1: matrix 82 rows 60 cols
[2024-05-22 23:37:00] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 23:37:00] [INFO ] Invariant cache hit.
[2024-05-22 23:37:00] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/69 places, 82/91 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 43 transition count 66
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 36 transition count 52
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 36 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 30 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 30 transition count 40
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 24 transition count 34
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 24 transition count 34
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 18 transition count 22
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 18 transition count 22
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 13 transition count 17
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 13 transition count 17
Applied a total of 92 rules in 10 ms. Remains 13 /59 variables (removed 46) and now considering 17/82 (removed 65) transitions.
[2024-05-22 23:37:00] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2024-05-22 23:37:00] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 23:37:00] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2024-05-22 23:37:00] [INFO ] Invariant cache hit.
[2024-05-22 23:37:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 23:37:00] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/69 places, 17/91 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 13/69 places, 17/91 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s12 0)), p2:(AND (NOT (AND (EQ s8 1) (EQ s12 1))) (NOT (AND (EQ s6 1) (EQ s12 1)))), p1:(AND (EQ s8 1) (EQ s12 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-13 finished in 336 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((p0||G(F(p1)))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 91/91 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 65 transition count 87
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 65 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 64 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 64 transition count 86
Applied a total of 10 rules in 2 ms. Remains 64 /69 variables (removed 5) and now considering 86/91 (removed 5) transitions.
// Phase 1: matrix 86 rows 64 cols
[2024-05-22 23:37:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:37:01] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 23:37:01] [INFO ] Invariant cache hit.
[2024-05-22 23:37:01] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-22 23:37:01] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 86/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 63/69 places, 86/91 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLFireability-14 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:(AND (EQ s25 1) (EQ s62 1)), p1:(AND (EQ s16 1) (EQ s62 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLFireability-14 finished in 303 ms.
All properties solved by simple procedures.
Total runtime 5764 ms.

BK_STOP 1716421022286

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

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