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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.5K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 9.6K Apr 13 05:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 05:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 05:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 05:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 110K 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-050051-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-050051-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863550759

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-050051
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:32:32] [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:32:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:32:32] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-28 02:32:32] [INFO ] Transformed 254 places.
[2024-05-28 02:32:32] [INFO ] Transformed 203 transitions.
[2024-05-28 02:32:32] [INFO ] Parsed PT model containing 254 places and 203 transitions and 608 arcs in 113 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 6 formulas.
FORMULA RefineWMG-PT-050051-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050051-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 28 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:32:32] [INFO ] Computed 102 invariants in 18 ms
[2024-05-28 02:32:32] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
[2024-05-28 02:32:32] [INFO ] Invariant cache hit.
[2024-05-28 02:32:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 02:32:32] [INFO ] Invariant cache hit.
[2024-05-28 02:32:33] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-28 02:32:33] [INFO ] Invariant cache hit.
[2024-05-28 02:32:33] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 254/254 places, 203/203 transitions.
Support contains 33 out of 254 places after structural reductions.
[2024-05-28 02:32:33] [INFO ] Flatten gal took : 37 ms
[2024-05-28 02:32:33] [INFO ] Flatten gal took : 20 ms
[2024-05-28 02:32:33] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 31 out of 254 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-28 02:32:33] [INFO ] Invariant cache hit.
[2024-05-28 02:32:33] [INFO ] [Real]Absence check using 102 positive place invariants in 15 ms returned sat
[2024-05-28 02:32:33] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-28 02:32:33] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2024-05-28 02:32:34] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-28 02:32:34] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 145 ms.
[2024-05-28 02:32:34] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Finished Parikh walk after 4998 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=166 )
Parikh walk visited 10 properties in 177 ms.
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' '!(X(F((p0||X(F((p0&&X(F((p1||G(F(p1))))))))))))'
Support contains 1 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 17 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:32:35] [INFO ] Invariant cache hit.
[2024-05-28 02:32:35] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
[2024-05-28 02:32:35] [INFO ] Invariant cache hit.
[2024-05-28 02:32:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 02:32:35] [INFO ] Invariant cache hit.
[2024-05-28 02:32:35] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-28 02:32:35] [INFO ] Invariant cache hit.
[2024-05-28 02:32:35] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 254/254 places, 203/203 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 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s91)], 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 455 ms.
Product exploration explored 100000 steps with 50000 reset in 399 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 23 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-00 finished in 1564 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)) U G(p1)))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 96 / 254 are part of one of the 48 SCC in 4 ms
Free SCC test removed 48 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 158 transition count 108
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 195 place count 60 transition count 59
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 238 place count 60 transition count 16
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 281 place count 17 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 281 place count 17 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 287 place count 14 transition count 13
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 3 with 2 rules applied. Total rules applied 289 place count 13 transition count 12
Applied a total of 289 rules in 24 ms. Remains 13 /254 variables (removed 241) and now considering 12/203 (removed 191) transitions.
// Phase 1: matrix 12 rows 13 cols
[2024-05-28 02:32:36] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 02:32:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-28 02:32:36] [INFO ] Invariant cache hit.
[2024-05-28 02:32:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 02:32:36] [INFO ] Invariant cache hit.
[2024-05-28 02:32:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:32:36] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:32:36] [INFO ] Invariant cache hit.
[2024-05-28 02:32:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/254 places, 12/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 13/254 places, 12/203 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s6 s11), p0:(LEQ 3 s9)], 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 229 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-02 finished in 265 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)&&X((F(p1) U p2)))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 12 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:32:36] [INFO ] Computed 102 invariants in 9 ms
[2024-05-28 02:32:36] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2024-05-28 02:32:36] [INFO ] Invariant cache hit.
[2024-05-28 02:32:37] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 02:32:37] [INFO ] Invariant cache hit.
[2024-05-28 02:32:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-28 02:32:37] [INFO ] Invariant cache hit.
[2024-05-28 02:32:37] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s244 s82), p2:(LEQ 1 s168), p1:(LEQ s108 s220)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 667 ms.
Product exploration explored 100000 steps with 1 reset in 786 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 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 378 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:32:39] [INFO ] Invariant cache hit.
[2024-05-28 02:32:39] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:32:39] [INFO ] [Nat]Absence check using 102 positive place invariants in 11 ms returned sat
[2024-05-28 02:32:39] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:32:40] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 57 ms.
[2024-05-28 02:32:40] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1255 steps, including 0 resets, run visited all 3 properties in 28 ms. (steps per millisecond=44 )
Parikh walk visited 3 properties in 28 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p2)]
Knowledge based reduction with 6 factoid took 532 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
[2024-05-28 02:32:41] [INFO ] Invariant cache hit.
[2024-05-28 02:32:41] [INFO ] [Real]Absence check using 102 positive place invariants in 1 ms returned unsat
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 6 factoid took 465 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-03 finished in 4873 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&&(p0 U p1))))))'
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 13 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:32:41] [INFO ] Invariant cache hit.
[2024-05-28 02:32:41] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2024-05-28 02:32:41] [INFO ] Invariant cache hit.
[2024-05-28 02:32:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 02:32:41] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s209 s245), p1:(LEQ 3 s53)], 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 5752 steps with 12 reset in 39 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-05 finished in 627 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)) U !p0))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 46 rules applied. Total rules applied 242 place count 58 transition count 11
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 2 with 46 rules applied. Total rules applied 288 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 288 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 290 place count 11 transition count 10
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 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 13 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:32:42] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-28 02:32:42] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/254 places, 9/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s8 s6)], 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-050051-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-06 finished in 217 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 1 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 199 place count 56 transition count 56
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 47 rules applied. Total rules applied 246 place count 56 transition count 9
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 2 with 47 rules applied. Total rules applied 293 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 293 place count 9 transition count 8
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 295 place count 8 transition count 8
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 3 with 2 rules applied. Total rules applied 297 place count 7 transition count 7
Applied a total of 297 rules in 15 ms. Remains 7 /254 variables (removed 247) and now considering 7/203 (removed 196) transitions.
// Phase 1: matrix 7 rows 7 cols
[2024-05-28 02:32:42] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-28 02:32:42] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/254 places, 7/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 7/254 places, 7/203 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s5)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-08 finished in 168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:32:42] [INFO ] Computed 102 invariants in 3 ms
[2024-05-28 02:32:42] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:42] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 02:32:42] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LEQ 1 s57) (LEQ 1 s216)), p0:(GT 1 s57)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14245 steps with 0 reset in 104 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-11 finished in 670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 145 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 1 with 141 rules applied. Total rules applied 190 place count 62 transition count 59
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 232 place count 62 transition count 17
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 274 place count 20 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 274 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 280 place count 17 transition count 14
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 3 with 2 rules applied. Total rules applied 282 place count 16 transition count 13
Applied a total of 282 rules in 8 ms. Remains 16 /254 variables (removed 238) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-28 02:32:43] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:32:43] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/254 places, 13/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 16/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s6 s12) (GT s14 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050051-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050051-LTLCardinality-13 finished in 174 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&&(p2||X(p3))))))'
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2024-05-28 02:32:43] [INFO ] Computed 102 invariants in 1 ms
[2024-05-28 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-28 02:32:43] [INFO ] Invariant cache hit.
[2024-05-28 02:32:43] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s92 s251), p2:(LEQ 2 s130), p3:(LEQ 2 s167), p0:(GT 2 s197)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 369 ms.
Product exploration explored 100000 steps with 50000 reset in 413 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 p1 (NOT p2) p3 (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 21 factoid took 128 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-14 finished in 1529 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(F(p1))))||(p2 U (p3||G(p2)))))'
Support contains 8 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-28 02:32:45] [INFO ] Invariant cache hit.
[2024-05-28 02:32:45] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
[2024-05-28 02:32:45] [INFO ] Invariant cache hit.
[2024-05-28 02:32:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 02:32:45] [INFO ] Invariant cache hit.
[2024-05-28 02:32:45] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-28 02:32:45] [INFO ] Invariant cache hit.
[2024-05-28 02:32:45] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-050051-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT s52 s148), p1:(LEQ s171 s81), p3:(AND (GT s117 s23) (GT s2 s211)), p2:(GT s2 s211)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Product exploration explored 100000 steps with 50000 reset in 363 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 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (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 7 factoid took 17 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-050051-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-050051-LTLCardinality-15 finished in 1426 ms.
All properties solved by simple procedures.
Total runtime 14338 ms.

BK_STOP 1716863567465

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

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