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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 02:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:00 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 43K 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-12a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-12a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716421351902

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-12a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:42:33] [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:42:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:42:33] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-22 23:42:33] [INFO ] Transformed 123 places.
[2024-05-22 23:42:33] [INFO ] Transformed 169 transitions.
[2024-05-22 23:42:33] [INFO ] Found NUPN structural information;
[2024-05-22 23:42:33] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 116 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 6 formulas.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 112 transition count 158
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 112 transition count 158
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 103 transition count 149
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 103 transition count 149
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 96 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 96 transition count 135
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 59 place count 96 transition count 130
Applied a total of 59 rules in 35 ms. Remains 96 /123 variables (removed 27) and now considering 130/169 (removed 39) transitions.
// Phase 1: matrix 130 rows 96 cols
[2024-05-22 23:42:33] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 23:42:34] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 23:42:34] [INFO ] Invariant cache hit.
[2024-05-22 23:42:34] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-22 23:42:34] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-22 23:42:34] [INFO ] Invariant cache hit.
[2024-05-22 23:42:34] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/123 places, 130/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 588 ms. Remains : 96/123 places, 130/169 transitions.
Support contains 17 out of 96 places after structural reductions.
[2024-05-22 23:42:34] [INFO ] Flatten gal took : 30 ms
[2024-05-22 23:42:34] [INFO ] Flatten gal took : 22 ms
[2024-05-22 23:42:34] [INFO ] Input system was already deterministic with 130 transitions.
Finished random walk after 762 steps, including 6 resets, run visited all 18 properties in 48 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 13 stable transitions
Graph (complete) has 297 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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)) U (p1||G(F(p2))))))'
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 94 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 93 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 93 transition count 127
Applied a total of 6 rules in 9 ms. Remains 93 /96 variables (removed 3) and now considering 127/130 (removed 3) transitions.
// Phase 1: matrix 127 rows 93 cols
[2024-05-22 23:42:34] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:42:34] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:42:34] [INFO ] Invariant cache hit.
[2024-05-22 23:42:34] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-22 23:42:35] [INFO ] Invariant cache hit.
[2024-05-22 23:42:35] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/96 places, 127/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 93/96 places, 127/130 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 440 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s91 1)), p2:(AND (EQ s69 1) (EQ s92 1)), p0:(AND (EQ s23 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-01 finished in 775 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 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Graph (complete) has 297 edges and 96 vertex of which 95 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 95 transition count 126
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 92 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 88 transition count 122
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 88 transition count 122
Applied a total of 15 rules in 25 ms. Remains 88 /96 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 88 cols
[2024-05-22 23:42:35] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 23:42:35] [INFO ] Invariant cache hit.
[2024-05-22 23:42:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/96 places, 122/130 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 56 place count 54 transition count 79
Iterating global reduction 0 with 10 rules applied. Total rules applied 66 place count 54 transition count 79
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 44 transition count 59
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 44 transition count 59
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 34 transition count 49
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 34 transition count 49
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 116 place count 24 transition count 29
Iterating global reduction 0 with 10 rules applied. Total rules applied 126 place count 24 transition count 29
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 14 transition count 19
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 147 place count 14 transition count 19
Applied a total of 147 rules in 14 ms. Remains 14 /87 variables (removed 73) and now considering 19/122 (removed 103) transitions.
[2024-05-22 23:42:35] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-22 23:42:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 23:42:35] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2024-05-22 23:42:35] [INFO ] Invariant cache hit.
[2024-05-22 23:42:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/96 places, 19/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 14/96 places, 19/130 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-02 finished in 307 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 U (p1||G(p0))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 91 transition count 125
Applied a total of 10 rules in 4 ms. Remains 91 /96 variables (removed 5) and now considering 125/130 (removed 5) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-22 23:42:35] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:42:35] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-22 23:42:35] [INFO ] Invariant cache hit.
[2024-05-22 23:42:36] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:36] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 125/130 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 169 ms. Remains : 90/96 places, 125/130 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s7 1) (EQ s89 1))) (NEQ s53 1)), p0:(NEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 331 ms.
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 247 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-03 finished in 923 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)||G(p1))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Graph (complete) has 297 edges and 96 vertex of which 95 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 95 transition count 126
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 92 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 88 transition count 122
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 88 transition count 122
Applied a total of 15 rules in 15 ms. Remains 88 /96 variables (removed 8) and now considering 122/130 (removed 8) transitions.
// Phase 1: matrix 122 rows 88 cols
[2024-05-22 23:42:36] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 23:42:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:42:36] [INFO ] Invariant cache hit.
[2024-05-22 23:42:36] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 134 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/96 places, 122/130 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 64 transition count 99
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 57 place count 53 transition count 77
Iterating global reduction 0 with 11 rules applied. Total rules applied 68 place count 53 transition count 77
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 79 place count 42 transition count 55
Iterating global reduction 0 with 11 rules applied. Total rules applied 90 place count 42 transition count 55
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 32 transition count 45
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 32 transition count 45
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 120 place count 22 transition count 25
Iterating global reduction 0 with 10 rules applied. Total rules applied 130 place count 22 transition count 25
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 13 transition count 16
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 13 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 149 place count 13 transition count 16
Applied a total of 149 rules in 14 ms. Remains 13 /87 variables (removed 74) and now considering 16/122 (removed 106) transitions.
[2024-05-22 23:42:36] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 13 cols
[2024-05-22 23:42:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:42:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 23:42:37] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 23:42:37] [INFO ] Invariant cache hit.
[2024-05-22 23:42:37] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 23:42:37] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/96 places, 16/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 13/96 places, 16/130 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s12 1)), p1:(OR (AND (EQ s4 1) (EQ s12 1)) (EQ s11 0) (EQ s12 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1296 reset in 228 ms.
Product exploration explored 100000 steps with 1298 reset in 257 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/13 stabilizing places and 13/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 9 factoid took 320 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10008 steps, including 145 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 31 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:42:38] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
[2024-05-22 23:42:38] [INFO ] Invariant cache hit.
[2024-05-22 23:42:38] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:42:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 23:42:38] [INFO ] After 46ms 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 (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-06 finished in 1459 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(p0) U (p0||X(G(p1))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 6 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 23:42:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:42:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:42:38] [INFO ] Invariant cache hit.
[2024-05-22 23:42:38] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:38] [INFO ] Implicit Places using invariants and state equation in 94 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-07 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s57 1), p1:(AND (EQ s68 1) (EQ s88 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 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-07 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' '!(X((G(p0)&&X(F(p1)))))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 93 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 91 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 91 transition count 125
Applied a total of 10 rules in 7 ms. Remains 91 /96 variables (removed 5) and now considering 125/130 (removed 5) transitions.
// Phase 1: matrix 125 rows 91 cols
[2024-05-22 23:42:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:42:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 23:42:38] [INFO ] Invariant cache hit.
[2024-05-22 23:42:38] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:38] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/96 places, 125/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 159 ms. Remains : 90/96 places, 125/130 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s53 0), p1:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-09 finished in 350 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(X(X(F(p0)))))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 6 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 23:42:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 23:42:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 23:42:39] [INFO ] Invariant cache hit.
[2024-05-22 23:42:39] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 147 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(OR (EQ s42 0) (EQ s88 0) (EQ s13 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 218 ms.
Product exploration explored 100000 steps with 16666 reset in 222 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 124/124 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2024-05-22 23:42:40] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 23:42:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:42:40] [INFO ] Invariant cache hit.
[2024-05-22 23:42:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-22 23:42:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-22 23:42:40] [INFO ] Invariant cache hit.
[2024-05-22 23:42:41] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 89/89 places, 124/124 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1511 steps, including 11 resets, run visited all 1 properties in 8 ms. (steps per millisecond=188 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 144 ms.
Product exploration explored 100000 steps with 16666 reset in 132 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 124/124 transitions.
Graph (complete) has 246 edges and 89 vertex of which 88 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 88 transition count 123
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 123
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 25 place count 88 transition count 146
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 36 place count 77 transition count 124
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 47 place count 77 transition count 124
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 68 place count 56 transition count 82
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 89 place count 56 transition count 82
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 47 transition count 73
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 47 transition count 73
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 116 place count 38 transition count 55
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 125 place count 38 transition count 55
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 143 place count 20 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 161 place count 20 transition count 28
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 161 rules in 30 ms. Remains 20 /89 variables (removed 69) and now considering 28/124 (removed 96) transitions.
[2024-05-22 23:42:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:42:42] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 20 cols
[2024-05-22 23:42:42] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:42:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/89 places, 28/124 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 20/89 places, 28/124 transitions.
Built C files in :
/tmp/ltsmin14408843211544623202
[2024-05-22 23:42:42] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14408843211544623202
Running compilation step : cd /tmp/ltsmin14408843211544623202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 305 ms.
Running link step : cd /tmp/ltsmin14408843211544623202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14408843211544623202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15325437861766224791.hoa' '--buchi-type=spotba'
LTSmin run took 225 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-10 finished in 4588 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(p1))||p0)))'
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 6 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
// Phase 1: matrix 124 rows 90 cols
[2024-05-22 23:42:43] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 23:42:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 23:42:43] [INFO ] Invariant cache hit.
[2024-05-22 23:42:43] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [89]
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 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s61 0) (EQ s88 0)), p1:(OR (NEQ s61 1) (NEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 14 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-12a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-11 finished in 604 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((F(p1)&&p0))))'
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 130/130 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 126
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 90 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 90 transition count 124
Applied a total of 12 rules in 7 ms. Remains 90 /96 variables (removed 6) and now considering 124/130 (removed 6) transitions.
[2024-05-22 23:42:44] [INFO ] Invariant cache hit.
[2024-05-22 23:42:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 23:42:44] [INFO ] Invariant cache hit.
[2024-05-22 23:42:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-22 23:42:44] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 161 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 89/96 places, 124/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 89/96 places, 124/130 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s88 1)), p1:(OR (EQ s61 0) (EQ s88 0) (AND (EQ s45 1) (EQ s88 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-LTLFireability-14 finished in 333 ms.
All properties solved by simple procedures.
Total runtime 11069 ms.

BK_STOP 1716421365430

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

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