About the Execution of 2023-gold for CSRepetitions-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 407.680 | 21560.00 | 35476.00 | 373.20 | FFTTTFFFFFFFFFFT | 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.r087-tall-171620521600158.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 CSRepetitions-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521600158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 50K Apr 12 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 208K Apr 12 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 12 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 340K Apr 12 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 35K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Apr 12 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 361K Apr 12 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 140K Apr 12 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 598K Apr 12 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 162K 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 CSRepetitions-PT-05-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716245782752
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=CSRepetitions-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 22:56:24] [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-20 22:56:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:56:24] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-20 22:56:24] [INFO ] Transformed 206 places.
[2024-05-20 22:56:24] [INFO ] Transformed 325 transitions.
[2024-05-20 22:56:24] [INFO ] Parsed PT model containing 206 places and 325 transitions and 1175 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CSRepetitions-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 185 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-20 22:56:24] [INFO ] Computed 30 invariants in 10 ms
[2024-05-20 22:56:24] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-20 22:56:24] [INFO ] Invariant cache hit.
[2024-05-20 22:56:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:24] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-20 22:56:24] [INFO ] Invariant cache hit.
[2024-05-20 22:56:25] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 736 ms. Remains : 206/206 places, 325/325 transitions.
Support contains 185 out of 206 places after structural reductions.
[2024-05-20 22:56:25] [INFO ] Flatten gal took : 60 ms
[2024-05-20 22:56:25] [INFO ] Flatten gal took : 48 ms
[2024-05-20 22:56:25] [INFO ] Input system was already deterministic with 325 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 23) seen :22
Finished Best-First random walk after 2194 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=365 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
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 150 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:26] [INFO ] Invariant cache hit.
[2024-05-20 22:56:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-20 22:56:26] [INFO ] Invariant cache hit.
[2024-05-20 22:56:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-20 22:56:26] [INFO ] Invariant cache hit.
[2024-05-20 22:56:26] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 206/206 places, 325/325 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 194 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-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 (OR (LT s53 1) (LT s203 1)) (OR (LT s46 1) (LT s109 1)) (OR (LT s60 1) (LT s167 1)) (OR (LT s32 1) (LT s63 1)) (OR (LT s26 1) (LT s40 1)) (OR (LT ...], 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 12 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-00 finished in 633 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 ((!p1&&X(X(!p0)))||X(X(G(!p0))))))'
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:26] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-20 22:56:27] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:27] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-20 22:56:27] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0, true]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s67 1) (GEQ s192 1) (GEQ s197 1) (GEQ s133 1) (GEQ s72 1) (GEQ s137 1) (GEQ s15 1) (GEQ s82 1) (GEQ s145 1) (GEQ s20 1) (GEQ s23 1) (GEQ s153 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 74 steps with 24 reset in 10 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-01 finished in 586 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)))'
Support contains 150 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:27] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:56:27] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:27] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-20 22:56:27] [INFO ] Invariant cache hit.
[2024-05-20 22:56:27] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s53 1) (LT s203 1)) (OR (LT s46 1) (LT s109 1)) (OR (LT s60 1) (LT s167 1)) (OR (LT s32 1) (LT s63 1)) (OR (LT s26 1) (LT s40 1)) (OR (LT ...], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 695 ms.
Product exploration explored 100000 steps with 50000 reset in 656 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-02 finished in 1739 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(p0))'
Support contains 25 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 330 place count 26 transition count 175
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 430 place count 26 transition count 75
Applied a total of 430 rules in 36 ms. Remains 26 /206 variables (removed 180) and now considering 75/325 (removed 250) transitions.
// Phase 1: matrix 75 rows 26 cols
[2024-05-20 22:56:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:56:29] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-20 22:56:29] [INFO ] Invariant cache hit.
[2024-05-20 22:56:29] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-20 22:56:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:56:29] [INFO ] Invariant cache hit.
[2024-05-20 22:56:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/206 places, 75/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 26/206 places, 75/325 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s24 1) (GEQ s25 1) (GEQ s16 1) (GEQ s9 1) (GEQ s17 1) (GEQ s0 1) (GEQ s10 1) (GEQ s18 1) (GEQ s1 1) (GEQ s2 1) (GEQ s19 1) (GEQ s3 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-03 finished in 467 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(p0))'
Support contains 151 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 18 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-20 22:56:29] [INFO ] Computed 30 invariants in 7 ms
[2024-05-20 22:56:29] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-20 22:56:29] [INFO ] Invariant cache hit.
[2024-05-20 22:56:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:29] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-20 22:56:29] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-20 22:56:29] [INFO ] Invariant cache hit.
[2024-05-20 22:56:30] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s86 1) (GEQ s123 1)) (AND (GEQ s73 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s126 1)) (AND (GEQ s86 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 540 ms.
Product exploration explored 100000 steps with 50000 reset in 548 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-04 finished in 1486 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 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 10 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:31] [INFO ] Invariant cache hit.
[2024-05-20 22:56:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-20 22:56:31] [INFO ] Invariant cache hit.
[2024-05-20 22:56:31] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:31] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-20 22:56:31] [INFO ] Invariant cache hit.
[2024-05-20 22:56:31] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 369 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND p1 p0), p0, (AND p1 p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (AND (GEQ s169 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s183 1)) (AND (GEQ s42 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s122 1)) (AND (GEQ s38 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1297 reset in 633 ms.
Stack based approach found an accepted trace after 2328 steps with 29 reset with depth 69 and stack size 69 in 18 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-05 finished in 1137 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(((!p0 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(F(!p0))&&(!p0 U (p1||G(!p0))))))))'
Support contains 151 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:32] [INFO ] Invariant cache hit.
[2024-05-20 22:56:32] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 22:56:32] [INFO ] Invariant cache hit.
[2024-05-20 22:56:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:32] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-20 22:56:32] [INFO ] Invariant cache hit.
[2024-05-20 22:56:32] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s53 1) (LT s203 1)) (OR (LT s46 1) (LT s109 1)) (OR (LT s60 1) (LT s167 1)) (OR (LT s32 1) (LT s63 1)) (OR (LT s26 1) (LT s40 1)) (OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 11015 steps with 502 reset in 325 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-07 finished in 728 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(F(((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))) U (G((p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))||(X(!p2)&&(p0||(X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))))))))))'
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:33] [INFO ] Invariant cache hit.
[2024-05-20 22:56:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-20 22:56:33] [INFO ] Invariant cache hit.
[2024-05-20 22:56:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:33] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-20 22:56:33] [INFO ] Invariant cache hit.
[2024-05-20 22:56:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=p1, acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 7}], [{ cond=(AND p1 p2), acceptance={1} source=6 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=6 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1 p2), acceptance={1} source=7 dest: 6}, { cond=(AND p0 p1 p2), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(LT s151 1), p1:(AND (GEQ s60 1) (GEQ s86 1)), p2:(AND (GEQ s4 1) (GEQ s67 1) (GEQ s62 1) (GEQ s100 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24600 reset in 264 ms.
Product exploration explored 100000 steps with 24621 reset in 284 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Incomplete random walk after 10002 steps, including 158 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 12) seen :6
Finished Best-First random walk after 2835 steps, including 1 resets, run visited all 6 properties in 5 ms. (steps per millisecond=567 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F p2), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 488 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:36] [INFO ] Invariant cache hit.
[2024-05-20 22:56:36] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-20 22:56:36] [INFO ] Invariant cache hit.
[2024-05-20 22:56:36] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:36] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-20 22:56:36] [INFO ] Invariant cache hit.
[2024-05-20 22:56:36] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 206/206 places, 325/325 transitions.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 2 factoid took 240 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Incomplete random walk after 10000 steps, including 158 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :5
Finished Best-First random walk after 4600 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=766 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (AND p1 p2)), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F p2), (F (AND (NOT p0) p1)), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 433 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p2 (NOT p0) p1), (AND (NOT p0) p1), false, (AND p2 (NOT p0) p1), false]
Product exploration explored 100000 steps with 24604 reset in 277 ms.
Product exploration explored 100000 steps with 24615 reset in 289 ms.
Built C files in :
/tmp/ltsmin11501946676885240606
[2024-05-20 22:56:39] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11501946676885240606
Running compilation step : cd /tmp/ltsmin11501946676885240606;'/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 551 ms.
Running link step : cd /tmp/ltsmin11501946676885240606;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11501946676885240606;'/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/stateBased3727265613587260201.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-PT-05-LTLFireability-08 finished in 7201 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) U p1)))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:40] [INFO ] Invariant cache hit.
[2024-05-20 22:56:40] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-20 22:56:40] [INFO ] Invariant cache hit.
[2024-05-20 22:56:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:40] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-20 22:56:40] [INFO ] Invariant cache hit.
[2024-05-20 22:56:40] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 398 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s8 1) (AND (GEQ s86 1) (GEQ s123 1))), p0:(AND (GEQ s63 1) (GEQ s86 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 47 steps with 23 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-09 finished in 530 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(p1)&&G(p2)&&X(p3)&&p0)))'
Support contains 7 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
[2024-05-20 22:56:40] [INFO ] Invariant cache hit.
[2024-05-20 22:56:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 22:56:40] [INFO ] Invariant cache hit.
[2024-05-20 22:56:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:41] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-20 22:56:41] [INFO ] Invariant cache hit.
[2024-05-20 22:56:41] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (AND p2 (NOT p3))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s73 1) (GEQ s144 1)), p2:(OR (LT s178 1) (LT s191 1)), p1:(OR (LT s15 1) (LT s38 1)), p3:(OR (LT s45 1) (LT s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-10 finished in 644 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(((G(F(p0))||(F(p0)&&G(F(!p1)))) U p2))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 66 place count 162 transition count 303
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 171 place count 57 transition count 198
Iterating global reduction 0 with 105 rules applied. Total rules applied 276 place count 57 transition count 198
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 294 place count 39 transition count 90
Iterating global reduction 0 with 18 rules applied. Total rules applied 312 place count 39 transition count 90
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 330 place count 39 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 340 place count 34 transition count 67
Applied a total of 340 rules in 24 ms. Remains 34 /206 variables (removed 172) and now considering 67/325 (removed 258) transitions.
[2024-05-20 22:56:41] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
// Phase 1: matrix 51 rows 34 cols
[2024-05-20 22:56:41] [INFO ] Computed 8 invariants in 1 ms
[2024-05-20 22:56:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:56:41] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
[2024-05-20 22:56:41] [INFO ] Invariant cache hit.
[2024-05-20 22:56:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-20 22:56:41] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-20 22:56:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:56:41] [INFO ] Flow matrix only has 51 transitions (discarded 16 similar events)
[2024-05-20 22:56:41] [INFO ] Invariant cache hit.
[2024-05-20 22:56:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/206 places, 67/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 34/206 places, 67/325 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s21 1) (GEQ s22 1)), p0:(GEQ s4 1), p1:(AND (GEQ s9 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1121 steps with 40 reset in 8 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-11 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 158 transition count 301
Discarding 115 places :
Symmetric choice reduction at 0 with 115 rule applications. Total rules 187 place count 43 transition count 186
Iterating global reduction 0 with 115 rules applied. Total rules applied 302 place count 43 transition count 186
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 322 place count 23 transition count 66
Iterating global reduction 0 with 20 rules applied. Total rules applied 342 place count 23 transition count 66
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 362 place count 23 transition count 46
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 372 place count 18 transition count 41
Applied a total of 372 rules in 17 ms. Remains 18 /206 variables (removed 188) and now considering 41/325 (removed 284) transitions.
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
// Phase 1: matrix 25 rows 18 cols
[2024-05-20 22:56:42] [INFO ] Computed 6 invariants in 1 ms
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-20 22:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 25 transitions (discarded 16 similar events)
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/206 places, 41/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 18/206 places, 41/325 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4165 reset in 152 ms.
Stack based approach found an accepted trace after 440 steps with 15 reset with depth 22 and stack size 21 in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-12 finished in 325 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(p1))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2024-05-20 22:56:42] [INFO ] Computed 30 invariants in 2 ms
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:42] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s106 1), p0:(AND (GEQ s45 1) (GEQ s100 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-13 finished in 538 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((p0||G(p1)||G(F(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 69 rules applied. Total rules applied 69 place count 160 transition count 302
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 179 place count 50 transition count 192
Iterating global reduction 0 with 110 rules applied. Total rules applied 289 place count 50 transition count 192
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 307 place count 32 transition count 84
Iterating global reduction 0 with 18 rules applied. Total rules applied 325 place count 32 transition count 84
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 343 place count 32 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 351 place count 28 transition count 62
Applied a total of 351 rules in 22 ms. Remains 28 /206 variables (removed 178) and now considering 62/325 (removed 263) transitions.
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
// Phase 1: matrix 47 rows 28 cols
[2024-05-20 22:56:42] [INFO ] Computed 7 invariants in 0 ms
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:56:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-20 22:56:42] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:56:42] [INFO ] Flow matrix only has 47 transitions (discarded 15 similar events)
[2024-05-20 22:56:42] [INFO ] Invariant cache hit.
[2024-05-20 22:56:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/206 places, 62/325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 130 ms. Remains : 28/206 places, 62/325 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s14 1)), p1:(AND (GEQ s8 1) (GEQ s23 1)), p2:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 14688 reset in 143 ms.
Stack based approach found an accepted trace after 63 steps with 8 reset with depth 9 and stack size 9 in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-14 finished in 373 ms.
All properties solved by simple procedures.
Total runtime 19177 ms.
BK_STOP 1716245804312
--------------------
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="CSRepetitions-PT-05"
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 CSRepetitions-PT-05, 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 r087-tall-171620521600158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-PT-05.tgz
mv CSRepetitions-PT-05 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 '
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 ;