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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 13 04:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 13 04:54 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 35K 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-015015-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-015015-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863251551

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-015015
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:27:33] [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:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:27:33] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-05-28 02:27:33] [INFO ] Transformed 79 places.
[2024-05-28 02:27:33] [INFO ] Transformed 63 transitions.
[2024-05-28 02:27:33] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 91 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 2 formulas.
FORMULA RefineWMG-PT-015015-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 17 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:33] [INFO ] Computed 32 invariants in 9 ms
[2024-05-28 02:27:33] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
[2024-05-28 02:27:33] [INFO ] Invariant cache hit.
[2024-05-28 02:27:33] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 02:27:33] [INFO ] Invariant cache hit.
[2024-05-28 02:27:33] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-28 02:27:33] [INFO ] Invariant cache hit.
[2024-05-28 02:27:33] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 38 out of 79 places after structural reductions.
[2024-05-28 02:27:34] [INFO ] Flatten gal took : 23 ms
[2024-05-28 02:27:34] [INFO ] Flatten gal took : 14 ms
[2024-05-28 02:27:34] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2024-05-28 02:27:34] [INFO ] Invariant cache hit.
[2024-05-28 02:27:34] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2024-05-28 02:27:34] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-28 02:27:34] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:34] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-28 02:27:34] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-28 02:27:35] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Finished Parikh walk after 497 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=165 )
Parikh walk visited 12 properties in 56 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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((p0||X(F((p0&&F((p1||G(p0)))))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:35] [INFO ] Invariant cache hit.
[2024-05-28 02:27:35] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
[2024-05-28 02:27:35] [INFO ] Invariant cache hit.
[2024-05-28 02:27:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 02:27:35] [INFO ] Invariant cache hit.
[2024-05-28 02:27:35] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 02:27:35] [INFO ] Invariant cache hit.
[2024-05-28 02:27:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 79/79 places, 63/63 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 259 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s6 s15), p1:(LEQ s30 s69)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 479 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-01 finished in 1176 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 U p1))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 44 edges and 79 vertex of which 30 / 79 are part of one of the 15 SCC in 3 ms
Free SCC test removed 15 places
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 49 transition count 34
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 57 place count 21 transition count 20
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 21 transition count 11
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 76 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 77 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 77 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 9 transition count 8
Applied a total of 81 rules in 13 ms. Remains 9 /79 variables (removed 70) and now considering 8/63 (removed 55) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-05-28 02:27:36] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:27:36] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-28 02:27:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/79 places, 8/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 9/79 places, 8/63 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s5), p0:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-02 finished in 230 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)&&(F(G(p1)) U p2)))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 38 edges and 79 vertex of which 24 / 79 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 55 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 54 place count 27 transition count 26
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 27 transition count 19
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 20 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 20 transition count 16
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 74 place count 17 transition count 16
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 76 place count 16 transition count 15
Applied a total of 76 rules in 8 ms. Remains 16 /79 variables (removed 63) and now considering 15/63 (removed 48) transitions.
// Phase 1: matrix 15 rows 16 cols
[2024-05-28 02:27:36] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:27:36] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 02:27:37] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/79 places, 15/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 16/79 places, 15/63 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LEQ s8 s14) (GT 1 s6)), p2:(LEQ 1 s6), p1:(LEQ 3 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-03 finished in 311 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(p0))&&(F(p1) U (X(F(p2))&&G(p0)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:37] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s12), p1:(LEQ 2 s48), p2:(LEQ 3 s65)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 354 ms.
Stack based approach found an accepted trace after 1967 steps with 0 reset with depth 1968 and stack size 1916 in 8 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-04 finished in 971 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)&&G((p1||G(p2))))))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(GT s67 s23), p2:(GT s35 s54), p1:(GT s38 s8)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-06 finished in 941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G((G(p1)||X(F(!p1)))) U G(p2))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 61 place count 27 transition count 16
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 16 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 76 place count 15 transition count 13
Applied a total of 76 rules in 6 ms. Remains 15 /79 variables (removed 64) and now considering 13/63 (removed 50) transitions.
// Phase 1: matrix 13 rows 15 cols
[2024-05-28 02:27:39] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-28 02:27:39] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/79 places, 13/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 15/79 places, 13/63 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p0)), p1, (NOT p0), false, (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s5 s12), p1:(LEQ s8 s3), p0:(LEQ 1 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33281 reset in 232 ms.
Product exploration explored 100000 steps with 33436 reset in 184 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X p0), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 288 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :3
Finished Best-First random walk after 912 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=228 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X p0), (X (AND p2 (NOT p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (AND p2 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F p1), (F (AND p2 p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 15 factoid took 493 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 13/13 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 02:27:41] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 15/15 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 115 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), p1, false, (AND 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
Finished Best-First random walk after 861 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=430 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F p1), (F (AND p1 p2)), (F (NOT p2)), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), p1, false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 33486 reset in 111 ms.
Product exploration explored 100000 steps with 33380 reset in 98 ms.
Built C files in :
/tmp/ltsmin513875903075877039
[2024-05-28 02:27:42] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-28 02:27:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:42] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-28 02:27:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:42] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-28 02:27:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:27:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin513875903075877039
Running compilation step : cd /tmp/ltsmin513875903075877039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 185 ms.
Running link step : cd /tmp/ltsmin513875903075877039;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin513875903075877039;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16045411099883594862.hoa' '--buchi-type=spotba'
LTSmin run took 6226 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-015015-LTLCardinality-07 finished in 10190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 58 place count 23 transition count 23
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 10 rules applied. Total rules applied 68 place count 23 transition count 13
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 78 place count 13 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 13 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 11 transition count 11
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 84 place count 10 transition count 10
Applied a total of 84 rules in 7 ms. Remains 10 /79 variables (removed 69) and now considering 10/63 (removed 53) transitions.
// Phase 1: matrix 10 rows 10 cols
[2024-05-28 02:27:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:27:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 02:27:49] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/79 places, 10/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 10/79 places, 10/63 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s5 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 100 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-09 finished in 216 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(X(X(G(p0))))))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:49] [INFO ] Computed 32 invariants in 3 ms
[2024-05-28 02:27:49] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:49] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-10 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s36 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 322 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-10 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(p1||G(F(p0)))))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:49] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s34), p1:(LEQ s65 s30)], 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]]
Product exploration explored 100000 steps with 309 reset in 247 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-11 finished in 759 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 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-12 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:(LEQ s28 s47)], 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 776 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-12 finished in 426 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)||F(p1)))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s50 s6), p0:(GT 1 s18)], 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 93 reset in 245 ms.
Stack based approach found an accepted trace after 20 steps with 8 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-13 finished in 612 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 U G(p1)))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 40 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 55 place count 25 transition count 24
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 25 transition count 17
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 18 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 18 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 16 transition count 15
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 75 place count 15 transition count 14
Applied a total of 75 rules in 8 ms. Remains 15 /79 variables (removed 64) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 15 cols
[2024-05-28 02:27:51] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-28 02:27:51] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:27:51] [INFO ] Invariant cache hit.
[2024-05-28 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/79 places, 14/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 15/79 places, 14/63 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=0 dest: 2}, { cond=(OR p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s12 s5), p2:(OR (LEQ 2 s14) (GT 1 s8)), p0:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-14 finished in 419 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(p0)&&F(p1))||X(G(p0)))))'
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:52] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:27:52] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2024-05-28 02:27:52] [INFO ] Invariant cache hit.
[2024-05-28 02:27:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 02:27:52] [INFO ] Invariant cache hit.
[2024-05-28 02:27:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-28 02:27:52] [INFO ] Invariant cache hit.
[2024-05-28 02:27:52] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT s70 s26), p0:(LEQ 2 s62)], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 238 ms.
Stack based approach found an accepted trace after 1270 steps with 2 reset with depth 1265 and stack size 1230 in 12 ms.
FORMULA RefineWMG-PT-015015-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLCardinality-15 finished in 701 ms.
All properties solved by simple procedures.
Total runtime 19656 ms.

BK_STOP 1716863273938

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

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