About the Execution of 2023-gold for RefineWMG-PT-005006
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
317.004 | 8825.00 | 14454.00 | 411.60 | FFFFFTFFTFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r329-tall-171662362200417.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 RefineWMG-PT-005006, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200417
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 05:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 13 05:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 13 05:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 05:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14K May 18 16:43 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 RefineWMG-PT-005006-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-005006-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716863042952
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=RefineWMG-PT-005006
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:24:04] [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-28 02:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:24:04] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2024-05-28 02:24:04] [INFO ] Transformed 29 places.
[2024-05-28 02:24:04] [INFO ] Transformed 23 transitions.
[2024-05-28 02:24:04] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-005006-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 15 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 02:24:04] [INFO ] Computed 12 invariants in 8 ms
[2024-05-28 02:24:05] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
[2024-05-28 02:24:05] [INFO ] Invariant cache hit.
[2024-05-28 02:24:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:24:05] [INFO ] Invariant cache hit.
[2024-05-28 02:24:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 02:24:05] [INFO ] Invariant cache hit.
[2024-05-28 02:24:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 20 out of 29 places after structural reductions.
[2024-05-28 02:24:05] [INFO ] Flatten gal took : 18 ms
[2024-05-28 02:24:05] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:24:05] [INFO ] Input system was already deterministic with 23 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:24:05] [INFO ] Invariant cache hit.
[2024-05-28 02:24:05] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 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' '!(F((X(p0)&&F(p1))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 29/29 places, 23/23 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 339 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s11 s24), p0:(LEQ s15 s25)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25 reset in 285 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-00 finished in 863 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)||G(F((p1||G(p2))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 12
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 12 transition count 10
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 20 place count 11 transition count 10
Applied a total of 20 rules in 12 ms. Remains 11 /29 variables (removed 18) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 02:24:06] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:24:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:06] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-28 02:24:06] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-28 02:24:06] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/29 places, 10/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 11/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s9), p2:(LEQ 2 s5), p1:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-01 finished in 279 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 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 02:24:07] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s26)], 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 1 reset in 191 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-03 finished in 458 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(G((p1&&(p2 U G(p3))))) U p2)))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 8 edges and 29 vertex of which 4 / 29 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 25 transition count 20
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 14 place count 17 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 16 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 16 transition count 14
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 18 place count 15 transition count 14
Applied a total of 18 rules in 5 ms. Remains 15 /29 variables (removed 14) and now considering 14/23 (removed 9) transitions.
// Phase 1: matrix 14 rows 15 cols
[2024-05-28 02:24:07] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 02:24:07] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-28 02:24:07] [INFO ] Invariant cache hit.
[2024-05-28 02:24:07] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/29 places, 14/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 15/29 places, 14/23 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p0 p1) (AND p0 p3 p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND p0 (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0) p1) (AND (NOT p0) p3 p1)), acceptance={0, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p3 p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p3 p1), acceptance={1, 2} source=1 dest: 2}, { cond=(AND p2 p0 p3 p1), acceptance={1} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={1, 2} source=1 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=1 dest: 3}], [{ cond=(AND p2 p0 (NOT p3) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND p0 (NOT p3) (NOT p1))), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p2 p0 p3 p1), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) p0 p3) (AND p0 p3 (NOT p1))), acceptance={1} source=2 dest: 2}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={2} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0) p3) (AND (NOT p0) p3 (NOT p1))), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p2 p0 p3 p1), acceptance={1} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) p0 p3), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={1, 2} source=3 dest: 2}, { cond=(AND p2 p0 p3), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 (NOT p0) p3), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s11), p0:(LEQ 3 s12), p1:(LEQ 1 s8), p3:(LEQ s14 s6)], nbAcceptance=3, 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-04 finished in 460 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||X(p1)))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 02:24:08] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s24 s17), p1:(LEQ s4 s27)], 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 105 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-005006-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-005006-LTLCardinality-05 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 11 transition count 10
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 7
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 23 place count 8 transition count 7
Applied a total of 23 rules in 6 ms. Remains 8 /29 variables (removed 21) and now considering 7/23 (removed 16) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-28 02:24:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:24:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/29 places, 7/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 8/29 places, 7/23 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s4), p1:(LEQ 2 s7)], nbAcceptance=2, 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 244 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-06 finished in 179 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) U p1))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 11 transition count 10
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 8 transition count 7
Applied a total of 23 rules in 7 ms. Remains 8 /29 variables (removed 21) and now considering 7/23 (removed 16) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-05-28 02:24:08] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-28 02:24:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:24:08] [INFO ] Invariant cache hit.
[2024-05-28 02:24:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/29 places, 7/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 8/29 places, 7/23 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(GT 1 s7), p0:(LEQ s5 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-07 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(p1))))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 02:24:08] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (GT s22 s7) (GT 2 s26)), p0:(GT 2 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-09 finished in 399 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) U X(p1)))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s1 s8), p1:(GT s22 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-10 finished in 353 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(G(p0))))'
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-28 02:24:09] [INFO ] Invariant cache hit.
[2024-05-28 02:24:09] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-11 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:(GT 1 s5)], 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 64 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-11 finished in 342 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||(p1 U p2)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 12
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 13 transition count 11
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 11 transition count 10
Applied a total of 20 rules in 6 ms. Remains 11 /29 variables (removed 18) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-05-28 02:24:10] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:24:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:24:10] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/29 places, 10/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 11/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (LEQ 2 s9) (LEQ s8 s6)), p0:(LEQ 2 s9)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-12 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G((p1&&(p2 U (p3||G(p2))))))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2024-05-28 02:24:10] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 02:24:10] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-28 02:24:10] [INFO ] Invariant cache hit.
[2024-05-28 02:24:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-005006-LTLCardinality-15 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: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ 1 s15), p1:(GT 3 s12), p3:(AND (GT 1 s12) (LEQ 3 s22)), p2:(LEQ 3 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-LTLCardinality-15 finished in 421 ms.
All properties solved by simple procedures.
Total runtime 6340 ms.
BK_STOP 1716863051777
--------------------
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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r329-tall-171662362200417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-005006.tgz
mv RefineWMG-PT-005006 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 '
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 ;