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.r197-tall-171640624800083.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 FlexibleBarrier-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624800083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 12:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 12:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 321K 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 FlexibleBarrier-PT-20a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716499762634

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=FlexibleBarrier-PT-20a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 21:29: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-23 21:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:29:24] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-23 21:29:24] [INFO ] Transformed 243 places.
[2024-05-23 21:29:24] [INFO ] Transformed 1064 transitions.
[2024-05-23 21:29:24] [INFO ] Found NUPN structural information;
[2024-05-23 21:29:24] [INFO ] Parsed PT model containing 243 places and 1064 transitions and 5317 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 362 transitions
Reduce redundant transitions removed 362 transitions.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 702/702 transitions.
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 243 transition count 682
Applied a total of 20 rules in 39 ms. Remains 243 /243 variables (removed 0) and now considering 682/702 (removed 20) transitions.
// Phase 1: matrix 682 rows 243 cols
[2024-05-23 21:29:24] [INFO ] Computed 22 invariants in 18 ms
[2024-05-23 21:29:25] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 21:29:25] [INFO ] Invariant cache hit.
[2024-05-23 21:29:25] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-23 21:29:25] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2024-05-23 21:29:25] [INFO ] Invariant cache hit.
[2024-05-23 21:29:25] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/243 places, 682/702 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1284 ms. Remains : 243/243 places, 682/702 transitions.
Support contains 30 out of 243 places after structural reductions.
[2024-05-23 21:29:26] [INFO ] Flatten gal took : 95 ms
[2024-05-23 21:29:26] [INFO ] Flatten gal took : 55 ms
[2024-05-23 21:29:26] [INFO ] Input system was already deterministic with 682 transitions.
Finished random walk after 508 steps, including 0 resets, run visited all 25 properties in 47 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 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(X(G(p0))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-23 21:29:26] [INFO ] Invariant cache hit.
[2024-05-23 21:29:26] [INFO ] Implicit Places using invariants in 112 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 242/243 places, 682/682 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 231 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s215 1) (NEQ s241 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-00 finished in 415 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 195 edges and 243 vertex of which 54 / 243 are part of one of the 18 SCC in 3 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 147 transition count 450
Drop transitions removed 223 transitions
Redundant transition composition rules discarded 223 transitions
Iterating global reduction 0 with 223 rules applied. Total rules applied 344 place count 147 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 345 place count 147 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 346 place count 146 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 347 place count 146 transition count 226
Applied a total of 347 rules in 76 ms. Remains 146 /243 variables (removed 97) and now considering 226/682 (removed 456) transitions.
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 189 transitions (discarded 37 similar events)
// Phase 1: matrix 189 rows 146 cols
[2024-05-23 21:29:27] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants in 103 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/243 places, 226/682 transitions.
Graph (trivial) has 198 edges and 145 vertex of which 54 / 145 are part of one of the 18 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 109 transition count 134
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 89 transition count 134
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 89 transition count 114
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 69 transition count 114
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 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 47 transition count 92
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 145 place count 47 transition count 72
Applied a total of 145 rules in 15 ms. Remains 47 /145 variables (removed 98) and now considering 72/226 (removed 154) transitions.
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
// Phase 1: matrix 51 rows 47 cols
[2024-05-23 21:29:27] [INFO ] Computed 21 invariants in 2 ms
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
[2024-05-23 21:29:27] [INFO ] Invariant cache hit.
[2024-05-23 21:29:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/243 places, 72/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 47/243 places, 72/682 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-01 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 (EQ s21 0) (EQ s32 0) (EQ s46 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-01 finished in 365 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 195 edges and 243 vertex of which 54 / 243 are part of one of the 18 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 147 transition count 450
Drop transitions removed 223 transitions
Redundant transition composition rules discarded 223 transitions
Iterating global reduction 0 with 223 rules applied. Total rules applied 344 place count 147 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 345 place count 147 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 346 place count 146 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 347 place count 146 transition count 226
Applied a total of 347 rules in 50 ms. Remains 146 /243 variables (removed 97) and now considering 226/682 (removed 456) transitions.
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 189 transitions (discarded 37 similar events)
// Phase 1: matrix 189 rows 146 cols
[2024-05-23 21:29:27] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants in 108 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/243 places, 226/682 transitions.
Graph (trivial) has 198 edges and 145 vertex of which 54 / 145 are part of one of the 18 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 109 transition count 134
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 89 transition count 134
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 89 transition count 114
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 69 transition count 114
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 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 47 transition count 92
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 145 place count 47 transition count 72
Applied a total of 145 rules in 11 ms. Remains 47 /145 variables (removed 98) and now considering 72/226 (removed 154) transitions.
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
// Phase 1: matrix 51 rows 47 cols
[2024-05-23 21:29:27] [INFO ] Computed 21 invariants in 0 ms
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 21:29:27] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
[2024-05-23 21:29:27] [INFO ] Invariant cache hit.
[2024-05-23 21:29:27] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-23 21:29:27] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/243 places, 72/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 47/243 places, 72/682 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s14 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-02 finished in 310 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)||X(X(G(p1)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2024-05-23 21:29:27] [INFO ] Computed 22 invariants in 5 ms
[2024-05-23 21:29:28] [INFO ] Implicit Places using invariants in 209 ms returned [241]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 219 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s44 1) (OR (EQ s146 0) (EQ s241 0))), p1:(AND (EQ s120 1) (EQ s131 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 340 reset in 839 ms.
Stack based approach found an accepted trace after 131 steps with 1 reset with depth 10 and stack size 10 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-04 finished in 1231 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)&&(G(p2)||p1)))||X((p3||G(p0)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-23 21:29:29] [INFO ] Invariant cache hit.
[2024-05-23 21:29:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-23 21:29:29] [INFO ] Invariant cache hit.
[2024-05-23 21:29:29] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-23 21:29:29] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-23 21:29:29] [INFO ] Invariant cache hit.
[2024-05-23 21:29:29] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 243/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(OR (EQ s120 0) (EQ s179 0) (EQ s241 0)), p2:(OR (EQ s24 0) (EQ s155 0) (EQ s241 0)), p0:(AND (EQ s120 1) (EQ s179 1) (EQ s241 1)), p3:(AND (EQ s172 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2345 reset in 875 ms.
Stack based approach found an accepted trace after 56 steps with 2 reset with depth 8 and stack size 8 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-06 finished in 2093 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((X((X(F(p1)) U p2))||p0))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
[2024-05-23 21:29:31] [INFO ] Invariant cache hit.
[2024-05-23 21:29:31] [INFO ] Implicit Places using invariants in 123 ms returned [242]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/243 places, 682/682 transitions.
Applied a total of 0 rules in 3 ms. Remains 242 /242 variables (removed 0) and now considering 682/682 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 242/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s143 0) (EQ s204 0) (EQ s241 0)), p2:(AND (EQ s150 1) (EQ s241 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1273 ms.
Product exploration explored 100000 steps with 50000 reset in 1263 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-08 finished in 2967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1&&(p2 U p3))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 182 edges and 243 vertex of which 39 / 243 are part of one of the 13 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 119 place count 158 transition count 531
Drop transitions removed 253 transitions
Redundant transition composition rules discarded 253 transitions
Iterating global reduction 0 with 253 rules applied. Total rules applied 372 place count 158 transition count 278
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 376 place count 158 transition count 278
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 380 place count 154 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 384 place count 154 transition count 274
Applied a total of 384 rules in 44 ms. Remains 154 /243 variables (removed 89) and now considering 274/682 (removed 408) transitions.
[2024-05-23 21:29:34] [INFO ] Flow matrix only has 242 transitions (discarded 32 similar events)
// Phase 1: matrix 242 rows 154 cols
[2024-05-23 21:29:34] [INFO ] Computed 22 invariants in 1 ms
[2024-05-23 21:29:34] [INFO ] Implicit Places using invariants in 118 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/243 places, 274/682 transitions.
Graph (trivial) has 194 edges and 153 vertex of which 39 / 153 are part of one of the 13 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 127 transition count 202
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 107 transition count 202
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 107 transition count 182
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 87 transition count 182
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 135 place count 60 transition count 155
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 155 place count 60 transition count 135
Applied a total of 155 rules in 16 ms. Remains 60 /153 variables (removed 93) and now considering 135/274 (removed 139) transitions.
[2024-05-23 21:29:34] [INFO ] Flow matrix only has 109 transitions (discarded 26 similar events)
// Phase 1: matrix 109 rows 60 cols
[2024-05-23 21:29:34] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 21:29:34] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 21:29:34] [INFO ] Flow matrix only has 109 transitions (discarded 26 similar events)
[2024-05-23 21:29:34] [INFO ] Invariant cache hit.
[2024-05-23 21:29:34] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-23 21:29:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/243 places, 135/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 60/243 places, 135/682 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s56 0), p1:(OR (AND (EQ s5 1) (EQ s11 1) (EQ s59 1)) (AND (EQ s32 1) (EQ s45 1) (EQ s59 1))), p3:(EQ s56 1), p2:(AND (EQ s40 1) (EQ s48 1) (EQ s59 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-09 finished in 390 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((F(p0)&&X(p1)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 682/682 (removed 0) transitions.
// Phase 1: matrix 682 rows 243 cols
[2024-05-23 21:29:34] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 21:29:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-23 21:29:34] [INFO ] Invariant cache hit.
[2024-05-23 21:29:34] [INFO ] State equation strengthened by 481 read => feed constraints.
[2024-05-23 21:29:35] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-23 21:29:35] [INFO ] Invariant cache hit.
[2024-05-23 21:29:35] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 243/243 places, 682/682 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s242 1)), p1:(OR (EQ s120 0) (EQ s179 0) (EQ s241 0))], nbAcceptance=0, 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]]
Product exploration explored 100000 steps with 215 reset in 562 ms.
Stack based approach found an accepted trace after 373 steps with 0 reset with depth 374 and stack size 374 in 2 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-11 finished in 1491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 191 edges and 243 vertex of which 51 / 243 are part of one of the 17 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 119 place count 150 transition count 469
Drop transitions removed 219 transitions
Redundant transition composition rules discarded 219 transitions
Iterating global reduction 0 with 219 rules applied. Total rules applied 338 place count 150 transition count 250
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 340 place count 150 transition count 250
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 342 place count 148 transition count 248
Iterating global reduction 0 with 2 rules applied. Total rules applied 344 place count 148 transition count 248
Applied a total of 344 rules in 33 ms. Remains 148 /243 variables (removed 95) and now considering 248/682 (removed 434) transitions.
[2024-05-23 21:29:36] [INFO ] Flow matrix only has 197 transitions (discarded 51 similar events)
// Phase 1: matrix 197 rows 148 cols
[2024-05-23 21:29:36] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 21:29:36] [INFO ] Implicit Places using invariants in 103 ms returned [147]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/243 places, 248/682 transitions.
Graph (trivial) has 196 edges and 147 vertex of which 51 / 147 are part of one of the 17 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 113 transition count 160
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 93 transition count 160
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 93 transition count 140
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 73 transition count 140
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 127 place count 50 transition count 117
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 147 place count 50 transition count 97
Applied a total of 147 rules in 9 ms. Remains 50 /147 variables (removed 97) and now considering 97/248 (removed 151) transitions.
[2024-05-23 21:29:36] [INFO ] Flow matrix only has 60 transitions (discarded 37 similar events)
// Phase 1: matrix 60 rows 50 cols
[2024-05-23 21:29:36] [INFO ] Computed 21 invariants in 0 ms
[2024-05-23 21:29:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 21:29:36] [INFO ] Flow matrix only has 60 transitions (discarded 37 similar events)
[2024-05-23 21:29:36] [INFO ] Invariant cache hit.
[2024-05-23 21:29:36] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-23 21:29:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/243 places, 97/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 50/243 places, 97/682 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s14 0) (EQ s42 0) (EQ s49 0)), p0:(OR (EQ s15 0) (EQ s32 0) (EQ s49 0))], 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 0 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 60 transitions (discarded 37 similar events)
[2024-05-23 21:29:37] [INFO ] Invariant cache hit.
[2024-05-23 21:29:37] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 21:29:37] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2024-05-23 21:29:37] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20a-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-13 finished in 1289 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 195 edges and 243 vertex of which 54 / 243 are part of one of the 18 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 172 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 0 with 120 rules applied. Total rules applied 121 place count 147 transition count 450
Drop transitions removed 223 transitions
Redundant transition composition rules discarded 223 transitions
Iterating global reduction 0 with 223 rules applied. Total rules applied 344 place count 147 transition count 227
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 345 place count 147 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 346 place count 146 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 347 place count 146 transition count 226
Applied a total of 347 rules in 29 ms. Remains 146 /243 variables (removed 97) and now considering 226/682 (removed 456) transitions.
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 189 transitions (discarded 37 similar events)
// Phase 1: matrix 189 rows 146 cols
[2024-05-23 21:29:37] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants in 120 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/243 places, 226/682 transitions.
Graph (trivial) has 198 edges and 145 vertex of which 54 / 145 are part of one of the 18 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 109 transition count 134
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 89 transition count 134
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 89 transition count 114
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 69 transition count 114
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 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 125 place count 47 transition count 92
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 145 place count 47 transition count 72
Applied a total of 145 rules in 8 ms. Remains 47 /145 variables (removed 98) and now considering 72/226 (removed 154) transitions.
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
// Phase 1: matrix 51 rows 47 cols
[2024-05-23 21:29:37] [INFO ] Computed 21 invariants in 0 ms
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 51 transitions (discarded 21 similar events)
[2024-05-23 21:29:37] [INFO ] Invariant cache hit.
[2024-05-23 21:29:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/243 places, 72/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 47/243 places, 72/682 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-14 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:(AND (EQ s17 1) (EQ s25 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-14 finished in 335 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||F(p1)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 682/682 transitions.
Graph (trivial) has 193 edges and 243 vertex of which 51 / 243 are part of one of the 17 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 123 place count 148 transition count 451
Drop transitions removed 221 transitions
Redundant transition composition rules discarded 221 transitions
Iterating global reduction 0 with 221 rules applied. Total rules applied 344 place count 148 transition count 230
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 345 place count 148 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 346 place count 147 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 347 place count 147 transition count 229
Applied a total of 347 rules in 25 ms. Remains 147 /243 variables (removed 96) and now considering 229/682 (removed 453) transitions.
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 193 transitions (discarded 36 similar events)
// Phase 1: matrix 193 rows 147 cols
[2024-05-23 21:29:37] [INFO ] Computed 22 invariants in 2 ms
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants in 101 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/243 places, 229/682 transitions.
Graph (trivial) has 196 edges and 146 vertex of which 51 / 146 are part of one of the 17 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 112 transition count 141
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 92 transition count 141
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 41 place count 92 transition count 121
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 81 place count 72 transition count 121
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 127 place count 49 transition count 98
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 147 place count 49 transition count 78
Applied a total of 147 rules in 6 ms. Remains 49 /146 variables (removed 97) and now considering 78/229 (removed 151) transitions.
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 56 transitions (discarded 22 similar events)
// Phase 1: matrix 56 rows 49 cols
[2024-05-23 21:29:37] [INFO ] Computed 21 invariants in 1 ms
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-23 21:29:37] [INFO ] Flow matrix only has 56 transitions (discarded 22 similar events)
[2024-05-23 21:29:37] [INFO ] Invariant cache hit.
[2024-05-23 21:29:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-23 21:29:37] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/243 places, 78/682 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 49/243 places, 78/682 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s26 1) (EQ s48 1)), p1:(AND (EQ s5 1) (EQ s46 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20a-LTLFireability-15 finished in 310 ms.
All properties solved by simple procedures.
Total runtime 13667 ms.

BK_STOP 1716499778859

--------------------
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="FlexibleBarrier-PT-20a"
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 FlexibleBarrier-PT-20a, 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 r197-tall-171640624800083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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