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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 26K Apr 12 09:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 09:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 09:32 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 16K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 12 09:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 209K Apr 12 09:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Apr 12 09:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 181K Apr 12 09:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.6K 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 40K 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-03-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716245630830

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-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-20 22:53:52] [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:53:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:53:52] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-05-20 22:53:52] [INFO ] Transformed 58 places.
[2024-05-20 22:53:52] [INFO ] Transformed 81 transitions.
[2024-05-20 22:53:52] [INFO ] Parsed PT model containing 58 places and 81 transitions and 279 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 8 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-05-20 22:53:52] [INFO ] Computed 12 invariants in 4 ms
[2024-05-20 22:53:52] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-20 22:53:52] [INFO ] Invariant cache hit.
[2024-05-20 22:53:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:52] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-20 22:53:52] [INFO ] Invariant cache hit.
[2024-05-20 22:53:52] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 58/58 places, 81/81 transitions.
Support contains 58 out of 58 places after structural reductions.
[2024-05-20 22:53:53] [INFO ] Flatten gal took : 24 ms
[2024-05-20 22:53:53] [INFO ] Flatten gal took : 12 ms
[2024-05-20 22:53:53] [INFO ] Input system was already deterministic with 81 transitions.
Finished random walk after 303 steps, including 10 resets, run visited all 23 properties in 27 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 0 stabilizing places and 9 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 45 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:53] [INFO ] Invariant cache hit.
[2024-05-20 22:53:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-20 22:53:53] [INFO ] Invariant cache hit.
[2024-05-20 22:53:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-20 22:53:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:53:53] [INFO ] Invariant cache hit.
[2024-05-20 22:53:53] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 58/58 places, 81/81 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 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s44 1)) (AND (GEQ s32 1) (GEQ s49 1)) (AND (GEQ s18 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s29 1) (GEQ s31 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 3 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-00 finished in 459 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)&&F(!p1))))'
Support contains 48 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:54] [INFO ] Invariant cache hit.
[2024-05-20 22:53:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-20 22:53:54] [INFO ] Invariant cache hit.
[2024-05-20 22:53:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-20 22:53:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:53:54] [INFO ] Invariant cache hit.
[2024-05-20 22:53:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 131 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s50 1)) (OR (LT s8 1) (LT s56 1)) (OR (LT s16 1) (LT s33 1)) (OR (LT s2 1) (LT s56 1)) (OR (LT s47 1) (LT s56 1)) (OR (LT s21 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7230 reset in 475 ms.
Stack based approach found an accepted trace after 1028 steps with 82 reset with depth 16 and stack size 16 in 5 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-01 finished in 934 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)||p0)&&(G(p2)||X(F(!p3))))))'
Support contains 21 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) p3)), (NOT p1), p3, (AND p3 (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 3}, { cond=(AND p2 p3), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s50 1)) (AND (GEQ s8 1) (GEQ s56 1)) (AND (GEQ s16 1) (GEQ s33 1)) (AND (GEQ s2 1) (GEQ s56 1)) (AND (GEQ s47 1) (GEQ s56 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5681 steps with 1258 reset in 25 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-02 finished in 403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 12 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s2 1) (LT s50 1)) (OR (LT s8 1) (LT s56 1)) (OR (LT s16 1) (LT s33 1)) (OR (LT s2 1) (LT s56 1)) (OR (LT s47 1) (LT s56 1)) (OR (LT s21 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-03 finished in 234 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 9 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-05-20 22:53:55] [INFO ] Invariant cache hit.
[2024-05-20 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s16 1) (GEQ s2 1) (GEQ s21 1) (GEQ s38 1) (GEQ s41 1) (GEQ s8 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 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][false, false]]
Product exploration explored 100000 steps with 18268 reset in 185 ms.
Product exploration explored 100000 steps with 18311 reset in 218 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-20 22:53:56] [INFO ] Invariant cache hit.
[2024-05-20 22:53:56] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2024-05-20 22:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:53:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-20 22:53:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:56] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-05-20 22:53:56] [INFO ] Computed and/alt/rep : 72/99/72 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-20 22:53:56] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 9 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 40 transition count 72
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 51 place count 16 transition count 48
Iterating global reduction 0 with 24 rules applied. Total rules applied 75 place count 16 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 84 place count 10 transition count 45
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 102 place count 10 transition count 27
Applied a total of 102 rules in 9 ms. Remains 10 /58 variables (removed 48) and now considering 27/81 (removed 54) transitions.
// Phase 1: matrix 27 rows 10 cols
[2024-05-20 22:53:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 22:53:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-20 22:53:56] [INFO ] Invariant cache hit.
[2024-05-20 22:53:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-20 22:53:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:53:56] [INFO ] Invariant cache hit.
[2024-05-20 22:53:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/58 places, 27/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 10/58 places, 27/81 transitions.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 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 11 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-03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-03-LTLFireability-04 finished in 1311 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))'
Support contains 36 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-05-20 22:53:57] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s44 1)) (AND (GEQ s32 1) (GEQ s49 1)) (AND (GEQ s18 1) (GEQ s49 1)) (AND (GEQ s0 1) (GEQ s4 1)) (AND (GEQ s29 1) (GEQ s31 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-05 finished in 204 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(p1)||p0) U (!p1&&X(F(p2)))))'
Support contains 22 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (GEQ s16 1) (GEQ s2 1) (GEQ s21 1) (GEQ s38 1) (GEQ s41 1) (GEQ s8 1) (GEQ s25 1) (GEQ s43 1) (GEQ s47 1)), p0:(OR (AND (GEQ s2 1) (GEQ s50 1)) (AN...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Computed a total of 0 stabilizing places and 9 stable transitions
Computed a total of 0 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p2), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-03-LTLFireability-06 finished in 565 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 10 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-20 22:53:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:53:57] [INFO ] Invariant cache hit.
[2024-05-20 22:53:57] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 44 ms :[p0]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s48 1)) (AND (GEQ s17 1) (GEQ s48 1)) (AND (GEQ s31 1) (GEQ s48 1)) (AND (GEQ s0 1) (GEQ s48 1)) (AND (GEQ s10 1) (GEQ s48 1)...], nbAcceptance=1, 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 2822 reset in 356 ms.
Stack based approach found an accepted trace after 710 steps with 20 reset with depth 19 and stack size 19 in 3 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-07 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G((!p0&&X(G((G(p2)||p1))))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:58] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 248 ms :[true, (OR p0 (AND (NOT p1) (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR p0 (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(AND (GEQ s18 1) (GEQ s49 1)), p1:(OR (LT s18 1) (LT s49 1)), p2:(AND (GEQ s21 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 224 steps with 7 reset in 2 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-08 finished in 403 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)&&F((!p1&&X(!p1))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-20 22:53:58] [INFO ] Invariant cache hit.
[2024-05-20 22:53:58] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s47 1)), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 91 steps with 8 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-09 finished in 323 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((X((p1 U G(p2)))&&p0))))'
Support contains 7 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 21 place count 44 transition count 74
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 39 place count 26 transition count 56
Iterating global reduction 0 with 18 rules applied. Total rules applied 57 place count 26 transition count 56
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 61 place count 22 transition count 40
Iterating global reduction 0 with 4 rules applied. Total rules applied 65 place count 22 transition count 40
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 69 place count 22 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 20 transition count 34
Applied a total of 73 rules in 17 ms. Remains 20 /58 variables (removed 38) and now considering 34/81 (removed 47) transitions.
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
// Phase 1: matrix 31 rows 20 cols
[2024-05-20 22:53:59] [INFO ] Computed 5 invariants in 0 ms
[2024-05-20 22:53:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-20 22:53:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-20 22:53:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 31 transitions (discarded 3 similar events)
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/58 places, 34/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 20/58 places, 34/81 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s18 1) (OR (LT s12 1) (LT s19 1))), p2:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-10 finished in 421 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((F(p0)&&X(G(!p0)))))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 42 transition count 73
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 45 place count 21 transition count 52
Iterating global reduction 0 with 21 rules applied. Total rules applied 66 place count 21 transition count 52
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 15 transition count 28
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 15 transition count 28
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 15 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 12 transition count 19
Applied a total of 90 rules in 10 ms. Remains 12 /58 variables (removed 46) and now considering 19/81 (removed 62) transitions.
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 12 cols
[2024-05-20 22:53:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-20 22:53:59] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-20 22:53:59] [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:53:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-20 22:53:59] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/58 places, 19/81 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 12/58 places, 19/81 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), p0]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-11 finished in 223 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 U p1)||G(p2))))'
Support contains 6 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 58 cols
[2024-05-20 22:53:59] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 22:53:59] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:53:59] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-20 22:53:59] [INFO ] Invariant cache hit.
[2024-05-20 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s31 1) (GEQ s48 1) (GEQ s25 1) (GEQ s33 1)) (AND (GEQ s17 1) (GEQ s48 1))), p0:(AND (GEQ s25 1) (GEQ s33 1)), p2:(OR (AND (GEQ s31 1) (GE...], 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 116 steps with 9 reset in 0 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-13 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p1||X(F(p2))))))'
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:54:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s43 1), p2:(OR (AND (OR (LT s37 1) (LT s48 1)) (GEQ s41 1)) (GEQ s41 1)), p0:(AND (GEQ s37 1) (GEQ s48 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]]
Stuttering criterion allowed to conclude after 56 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-14 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-20 22:54:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-20 22:54:00] [INFO ] Invariant cache hit.
[2024-05-20 22:54:00] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 58/58 places, 81/81 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Running random walk in product with property : CSRepetitions-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s28 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-03-LTLFireability-15 finished in 222 ms.
All properties solved by simple procedures.
Total runtime 8376 ms.

BK_STOP 1716245641495

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

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