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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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.8K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 13 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 13 08:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 08:53 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 64K 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-08a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716495760091

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-23 20:22:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:22:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:22:41] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 20:22:41] [INFO ] Transformed 99 places.
[2024-05-23 20:22:41] [INFO ] Transformed 236 transitions.
[2024-05-23 20:22:41] [INFO ] Found NUPN structural information;
[2024-05-23 20:22:41] [INFO ] Parsed PT model containing 99 places and 236 transitions and 985 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 50 transitions
Reduce redundant transitions removed 50 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 186/186 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 99 transition count 178
Applied a total of 8 rules in 20 ms. Remains 99 /99 variables (removed 0) and now considering 178/186 (removed 8) transitions.
// Phase 1: matrix 178 rows 99 cols
[2024-05-23 20:22:42] [INFO ] Computed 10 invariants in 10 ms
[2024-05-23 20:22:42] [INFO ] Implicit Places using invariants in 204 ms returned [97, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 226 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/99 places, 178/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 250 ms. Remains : 97/99 places, 178/186 transitions.
Support contains 35 out of 97 places after structural reductions.
[2024-05-23 20:22:42] [INFO ] Flatten gal took : 33 ms
[2024-05-23 20:22:42] [INFO ] Flatten gal took : 14 ms
[2024-05-23 20:22:42] [INFO ] Input system was already deterministic with 178 transitions.
Support contains 34 out of 97 places (down from 35) after GAL structural reductions.
Finished random walk after 3380 steps, including 1 resets, run visited all 22 properties in 78 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 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((X(F(p0)) U (p1||(p2&&G(!p1)))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 97 cols
[2024-05-23 20:22:43] [INFO ] Computed 8 invariants in 3 ms
[2024-05-23 20:22:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-23 20:22:43] [INFO ] Invariant cache hit.
[2024-05-23 20:22:43] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-23 20:22:43] [INFO ] Invariant cache hit.
[2024-05-23 20:22:43] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 97/97 places, 178/178 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 492 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s58 1), p2:(OR (EQ s8 0) (EQ s90 1)), p0:(OR (EQ s49 0) (EQ s27 1) (EQ s8 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 357 ms.
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-01 finished in 1397 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 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s8 0) (NEQ s96 1) (NEQ s54 0) (NEQ s26 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 FlexibleBarrier-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-02 finished in 271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-23 20:22:44] [INFO ] Invariant cache hit.
[2024-05-23 20:22:44] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s13 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-03 finished in 731 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 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-23 20:22:45] [INFO ] Invariant cache hit.
[2024-05-23 20:22:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 20:22:45] [INFO ] Invariant cache hit.
[2024-05-23 20:22:45] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-23 20:22:45] [INFO ] Invariant cache hit.
[2024-05-23 20:22:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 97/97 places, 178/178 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-06 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 (EQ s71 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-06 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(F(p0)) U p1) U p2))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 116 edges and 97 vertex of which 80 / 97 are part of one of the 12 SCC in 4 ms
Free SCC test removed 68 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 24 transition count 44
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 21 transition count 44
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 20 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 20 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 20 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 19 transition count 40
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 4 with 6 rules applied. Total rules applied 49 place count 16 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 16 transition count 36
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 67 place count 16 transition count 19
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 68 place count 16 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 70 place count 15 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 71 place count 14 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 71 place count 14 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 75 place count 12 transition count 15
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 76 place count 11 transition count 14
Iterating global reduction 8 with 1 rules applied. Total rules applied 77 place count 11 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 78 place count 11 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 78 place count 11 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 80 place count 10 transition count 12
Applied a total of 80 rules in 17 ms. Remains 10 /97 variables (removed 87) and now considering 12/178 (removed 166) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-05-23 20:22:46] [INFO ] Computed 4 invariants in 0 ms
[2024-05-23 20:22:46] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 20:22:46] [INFO ] Invariant cache hit.
[2024-05-23 20:22:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-23 20:22:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:46] [INFO ] Invariant cache hit.
[2024-05-23 20:22:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/97 places, 12/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 10/97 places, 12/178 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, p2, p0, (AND p0 p2), (AND p2 p1 p0), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2 p0), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(EQ s0 1), p1:(OR (EQ s8 0) (EQ s4 1)), p0:(OR (EQ s2 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-07 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&G(p1))||(G((p2 U !p3))&&X(G(p4))))))'
Support contains 9 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 107 edges and 97 vertex of which 62 / 97 are part of one of the 11 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 46 transition count 105
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 41 transition count 103
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 39 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 39 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 38 transition count 102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 20 place count 35 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 35 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 30 place count 35 transition count 89
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 35 place count 31 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 36 place count 30 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 44 place count 26 transition count 84
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 78 place count 26 transition count 50
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 25 transition count 48
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 25 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 25 transition count 48
Applied a total of 81 rules in 20 ms. Remains 25 /97 variables (removed 72) and now considering 48/178 (removed 130) transitions.
[2024-05-23 20:22:46] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 25 cols
[2024-05-23 20:22:46] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 20:22:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 20:22:46] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2024-05-23 20:22:46] [INFO ] Invariant cache hit.
[2024-05-23 20:22:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 20:22:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-23 20:22:46] [INFO ] Redundant transitions in 21 ms returned [19, 20, 21]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
[2024-05-23 20:22:46] [INFO ] Flow matrix only has 38 transitions (discarded 7 similar events)
// Phase 1: matrix 38 rows 25 cols
[2024-05-23 20:22:46] [INFO ] Computed 7 invariants in 5 ms
[2024-05-23 20:22:46] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/97 places, 45/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 25/97 places, 45/178 transitions.
Stuttering acceptance computed with spot in 844 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p1) p3) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) p3) (AND (NOT p0) p3)), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p1) p3)), (AND (NOT p1) p3), (AND (NOT p1) (NOT p4)), (AND (NOT p1) p3)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 2} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1, 2} source=0 dest: 4}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 p2)), acceptance={2} source=0 dest: 5}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 p2)), acceptance={1, 2} source=0 dest: 6}, { cond=(AND p0 p1 p3 p2), acceptance={1, 2} source=0 dest: 7}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2) (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1, 2} source=1 dest: 4}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p1 p2)), acceptance={2} source=1 dest: 5}, { cond=(AND p0 p1 p3 p2), acceptance={1, 2} source=1 dest: 7}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2) (NOT p4)) (AND (NOT p1) p3 (NOT p2) (NOT p4))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4))), acceptance={0, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p4) (AND (NOT p1) p4)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4))), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3 p2 (NOT p4)) (AND (NOT p1) p3 p2 (NOT p4))), acceptance={0, 1, 2} source=2 dest: 3}, { cond=(AND p0 p1 p3 (NOT p2) (NOT p4)), acceptance={1, 2} source=2 dest: 4}, { cond=(OR (AND p0 p1 (NOT p3) (NOT p4)) (AND p0 p1 p2 (NOT p4))), acceptance={2} source=2 dest: 5}, { cond=(AND p0 p1 p4), acceptance={1} source=2 dest: 6}, { cond=(OR (AND p0 p1 (NOT p3) (NOT p4)) (AND p0 p1 p2 (NOT p4))), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p0 p1 p3 p2 (NOT p4)), acceptance={1, 2} source=2 dest: 7}], [{ cond=(OR (AND (NOT p0) p3 (NOT p2)) (AND (NOT p1) p3 (NOT p2))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p3 p2) (AND (NOT p1) p3 p2)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 p1 p3 (NOT p2)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p0 p1 p3 p2), acceptance={1, 2} source=3 dest: 7}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 2} source=4 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(AND (NOT p1) p3 p2), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p1 p2)), acceptance={2} source=4 dest: 5}, { cond=(OR (AND p1 (NOT p3)) (AND p1 p2)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND p1 p3 p2), acceptance={1, 2} source=4 dest: 7}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), acceptance={0, 2} source=5 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={1, 2} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p3)) (AND p1 p2)), acceptance={2} source=5 dest: 5}, { cond=(AND p1 p3 p2), acceptance={1, 2} source=5 dest: 7}], [{ cond=(AND (NOT p1) p3 (NOT p2) (NOT p4)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4))), acceptance={0, 2} source=6 dest: 1}, { cond=(AND (NOT p1) p4), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4))), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND (NOT p1) p3 p2 (NOT p4)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p1 p3 (NOT p2) (NOT p4)), acceptance={1, 2} source=6 dest: 4}, { cond=(OR (AND p1 (NOT p3) (NOT p4)) (AND p1 p2 (NOT p4))), acceptance={2} source=6 dest: 5}, { cond=(AND p1 p4), acceptance={1} source=6 dest: 6}, { cond=(OR (AND p1 (NOT p3) (NOT p4)) (AND p1 p2 (NOT p4))), acceptance={1, 2} source=6 dest: 6}, { cond=(AND p1 p3 p2 (NOT p4)), acceptance={1, 2} source=6 dest: 7}], [{ cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) p3 p2), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND p1 p3 (NOT p2)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p1 p3 p2), acceptance={1, 2} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s21 1)), p3:(OR (EQ s5 0) (EQ s15 1)), p2:(OR (EQ s7 0) (EQ s13 1)), p1:(OR (EQ s19 0) (EQ s17 1)), p4:(OR (EQ s3 0) (EQ s7 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-08 finished in 1017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 123 edges and 97 vertex of which 88 / 97 are part of one of the 12 SCC in 0 ms
Free SCC test removed 76 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 12 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 10 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 10 transition count 18
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 55 place count 7 transition count 13
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 60 place count 7 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 62 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 64 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 64 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 66 place count 4 transition count 5
Applied a total of 66 rules in 16 ms. Remains 4 /97 variables (removed 93) and now considering 5/178 (removed 173) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-23 20:22:47] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-23 20:22:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/97 places, 5/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 4/97 places, 5/178 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-09 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 s2 0) (EQ s0 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 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-09 finished in 263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 123 edges and 97 vertex of which 91 / 97 are part of one of the 9 SCC in 1 ms
Free SCC test removed 82 places
Ensure Unique test removed 131 transitions
Reduce isomorphic transitions removed 131 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 8 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 7 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 41 place count 7 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 6 transition count 12
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 6 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 48 place count 6 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 4 transition count 5
Applied a total of 52 rules in 4 ms. Remains 4 /97 variables (removed 93) and now considering 5/178 (removed 173) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-23 20:22:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-23 20:22:47] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/97 places, 5/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 4/97 places, 5/178 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-10 finished in 202 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)) U p2))))'
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 111 edges and 97 vertex of which 60 / 97 are part of one of the 12 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 49 transition count 107
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 41 transition count 104
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 23 place count 38 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 38 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 37 transition count 103
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 29 place count 33 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 33 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 9 rules applied. Total rules applied 42 place count 33 transition count 86
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 48 place count 28 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 27 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 51 place count 26 transition count 84
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 6 with 35 rules applied. Total rules applied 86 place count 26 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 87 place count 26 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 88 place count 25 transition count 48
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 90 place count 25 transition count 48
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 92 place count 23 transition count 46
Iterating global reduction 8 with 2 rules applied. Total rules applied 94 place count 23 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 96 place count 23 transition count 44
Applied a total of 96 rules in 22 ms. Remains 23 /97 variables (removed 74) and now considering 44/178 (removed 134) transitions.
[2024-05-23 20:22:47] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
// Phase 1: matrix 35 rows 23 cols
[2024-05-23 20:22:47] [INFO ] Computed 8 invariants in 0 ms
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-23 20:22:47] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 20:22:47] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-23 20:22:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 20:22:47] [INFO ] Flow matrix only has 35 transitions (discarded 9 similar events)
[2024-05-23 20:22:47] [INFO ] Invariant cache hit.
[2024-05-23 20:22:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/97 places, 44/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 23/97 places, 44/178 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s5 0) (EQ s19 1)), p0:(OR (EQ s9 0) (EQ s15 1)), p1:(OR (EQ s17 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-12 finished in 358 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 125 edges and 97 vertex of which 92 / 97 are part of one of the 8 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 41
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 2 with 29 rules applied. Total rules applied 34 place count 11 transition count 12
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 40 place count 5 transition count 6
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 5 transition count 6
Applied a total of 46 rules in 3 ms. Remains 5 /97 variables (removed 92) and now considering 6/178 (removed 172) transitions.
[2024-05-23 20:22:48] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 5 cols
[2024-05-23 20:22:48] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 20:22:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-23 20:22:48] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:48] [INFO ] Invariant cache hit.
[2024-05-23 20:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-23 20:22:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:48] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:48] [INFO ] Invariant cache hit.
[2024-05-23 20:22:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/97 places, 6/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 5/97 places, 6/178 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-13 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 s0 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 1 reset in 104 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
[2024-05-23 20:22:49] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:49] [INFO ] Invariant cache hit.
[2024-05-23 20:22:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 20:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:49] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-23 20:22:49] [INFO ] Computed and/alt/rep : 5/7/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-23 20:22:49] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-23 20:22:49] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:49] [INFO ] Invariant cache hit.
[2024-05-23 20:22:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 20:22:49] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:49] [INFO ] Invariant cache hit.
[2024-05-23 20:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:49] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-23 20:22:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:49] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:49] [INFO ] Invariant cache hit.
[2024-05-23 20:22:49] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 5/5 places, 6/6 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-05-23 20:22:49] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-23 20:22:49] [INFO ] Invariant cache hit.
[2024-05-23 20:22:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 20:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:22:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-23 20:22:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 20:22:49] [INFO ] [Real]Added 1 Read/Feed constraints in 21 ms returned sat
[2024-05-23 20:22:49] [INFO ] Computed and/alt/rep : 5/7/4 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-23 20:22:49] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 2 reset in 191 ms.
Built C files in :
/tmp/ltsmin13218415996464304323
[2024-05-23 20:22:50] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-23 20:22:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:22:50] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-23 20:22:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:22:50] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-23 20:22:50] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 20:22:50] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13218415996464304323
Running compilation step : cd /tmp/ltsmin13218415996464304323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin13218415996464304323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin13218415996464304323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1341507658430385138.hoa' '--buchi-type=spotba'
LTSmin run took 254 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-13 finished in 2640 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)||F(p1)))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 178/178 transitions.
Graph (trivial) has 119 edges and 97 vertex of which 84 / 97 are part of one of the 12 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 109 transitions
Reduce isomorphic transitions removed 109 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 19 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 17 transition count 34
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 15 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 15 transition count 30
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 15 transition count 26
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 13 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 54 place count 12 transition count 25
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 65 place count 12 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 67 place count 12 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 69 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 69 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 73 place count 8 transition count 10
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 74 place count 8 transition count 10
Applied a total of 74 rules in 5 ms. Remains 8 /97 variables (removed 89) and now considering 10/178 (removed 168) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-23 20:22:50] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 20:22:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-23 20:22:50] [INFO ] Invariant cache hit.
[2024-05-23 20:22:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-23 20:22:50] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 20:22:50] [INFO ] Invariant cache hit.
[2024-05-23 20:22:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/97 places, 10/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 8/97 places, 10/178 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s2 0) (EQ s4 1)), p0:(AND (EQ s6 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08a-LTLCardinality-14 finished in 277 ms.
All properties solved by simple procedures.
Total runtime 9515 ms.

BK_STOP 1716495772358

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-08a"
export BK_EXAMINATION="LTLCardinality"
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-08a, examination is LTLCardinality"
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-171640624700022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08a.tgz
mv FlexibleBarrier-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;