Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572400539.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RefineWMG-PT-025025, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572400539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 30 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 56K May 10 09:34 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-025025-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-025025-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653084876574

Running Version 202205111006
[2022-05-20 22:14:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 22:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:14:37] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2022-05-20 22:14:37] [INFO ] Transformed 129 places.
[2022-05-20 22:14:37] [INFO ] Transformed 103 transitions.
[2022-05-20 22:14:37] [INFO ] Parsed PT model containing 129 places and 103 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA RefineWMG-PT-025025-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025025-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:38] [INFO ] Computed 52 place invariants in 9 ms
[2022-05-20 22:14:38] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:38] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:14:38] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:38] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:14:38] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:38] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:14:38] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Support contains 40 out of 129 places after structural reductions.
[2022-05-20 22:14:38] [INFO ] Flatten gal took : 56 ms
[2022-05-20 22:14:38] [INFO ] Flatten gal took : 18 ms
[2022-05-20 22:14:38] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 28) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:39] [INFO ] Computed 52 place invariants in 2 ms
[2022-05-20 22:14:39] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:14:39] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2022-05-20 22:14:39] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2022-05-20 22:14:39] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-20 22:14:39] [INFO ] After 448ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 186 ms.
[2022-05-20 22:14:39] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Finished Parikh walk after 1365 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=227 )
Parikh walk visited 17 properties in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(p2)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:40] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:40] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:40] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:40] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:40] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:41] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:41] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:41] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 354 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LEQ 3 s6), p0:(LEQ s122 s125), p2:(LEQ s114 s98)], 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 434 ms.
Product exploration explored 100000 steps with 50000 reset in 306 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 p0) p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 15 factoid took 229 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-02 finished in 1969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!((!X(G(p0)) U X(p0))||p1)) U X(p2)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:42] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:42] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:42] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), p2, p2, (AND (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s15 s101), p2:(LEQ 1 s79), p1:(LEQ s84 s66)], 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 226 ms.
Product exploration explored 100000 steps with 50000 reset in 242 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 p2)), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 6 factoid took 127 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-04 finished in 1189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)&&p1))||p2)))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:43] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:43] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:43] [INFO ] Computed 52 place invariants in 12 ms
[2022-05-20 22:14:43] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:43] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:43] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:43] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:44] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 3 s0), p2:(GT s111 s105), p1:(GT 3 s106)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 321 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 p2 (NOT p1)), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p2)))), true, (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1 (NOT p2))))
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-05 finished in 1219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(F(X(G(p0)))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 3 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 94 place count 33 transition count 31
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 114 place count 33 transition count 11
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 134 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 13 transition count 9
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 138 place count 11 transition count 9
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 140 place count 10 transition count 8
Applied a total of 140 rules in 30 ms. Remains 10 /129 variables (removed 119) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:44] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:44] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-20 22:14:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 8/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 8/103 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-07 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 s5 s9)], 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-025025-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-07 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 94 place count 33 transition count 31
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 20 rules applied. Total rules applied 114 place count 33 transition count 11
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 134 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 134 place count 13 transition count 9
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 11 transition count 9
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 140 place count 10 transition count 8
Applied a total of 140 rules in 19 ms. Remains 10 /129 variables (removed 119) and now considering 8/103 (removed 95) transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 22:14:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2022-05-20 22:14:45] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/129 places, 8/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/129 places, 8/103 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 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 7 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-09 finished in 181 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||G(p1)||p2))))'
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:45] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:45] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:45] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:14:45] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:45] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s37 s59), p2:(AND (LEQ s74 s53) (LEQ s37 s59)), p0:(LEQ s21 s22)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 536 ms.
Stack based approach found an accepted trace after 138 steps with 0 reset with depth 139 and stack size 137 in 2 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-10 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(!p0 U p1)))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:46] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:46] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:46] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:46] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:46] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:46] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s3 s80), p1:(LEQ s17 s71)], 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 293 ms.
Product exploration explored 100000 steps with 50000 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA RefineWMG-PT-025025-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-025025-LTLCardinality-11 finished in 1086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X(p2)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:47] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:47] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:47] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:47] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:47] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:47] [INFO ] Computed 52 place invariants in 3 ms
[2022-05-20 22:14:47] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(LEQ s7 s61), p0:(LEQ 1 s54), p2:(LEQ s79 s11)], 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 551 steps with 2 reset in 4 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-12 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 70 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 72 rules applied. Total rules applied 95 place count 35 transition count 34
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 114 place count 35 transition count 15
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 133 place count 16 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 133 place count 16 transition count 12
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 139 place count 13 transition count 12
Applied a total of 139 rules in 11 ms. Remains 13 /129 variables (removed 116) and now considering 12/103 (removed 91) transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:14:47] [INFO ] Computed 5 place invariants in 14 ms
[2022-05-20 22:14:48] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:14:48] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:14:48] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-20 22:14:48] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2022-05-20 22:14:48] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/129 places, 12/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/129 places, 12/103 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s8), p1:(LEQ s11 s5)], 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 356 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-13 finished in 270 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X((G((p0 U p1))&&p2))||G(p0)||p3)))))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 71 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 98 place count 33 transition count 33
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 14 rules applied. Total rules applied 112 place count 33 transition count 19
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 127 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 18 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 128 place count 18 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 134 place count 15 transition count 15
Applied a total of 134 rules in 5 ms. Remains 15 /129 variables (removed 114) and now considering 15/103 (removed 88) transitions.
// Phase 1: matrix 15 rows 15 cols
[2022-05-20 22:14:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
// Phase 1: matrix 15 rows 15 cols
[2022-05-20 22:14:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-20 22:14:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-20 22:14:48] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 15 rows 15 cols
[2022-05-20 22:14:48] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/129 places, 15/103 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/129 places, 15/103 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p3) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s7), p3:(LEQ s8 s14), p0:(LEQ 3 s5), p2:(LEQ 2 s11)], nbAcceptance=2, 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 57633 steps with 0 reset in 82 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-14 finished in 453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&F(X(X(p2)))&&p0)))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:48] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:48] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:48] [INFO ] Computed 52 place invariants in 0 ms
[2022-05-20 22:14:48] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:48] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:49] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2022-05-20 22:14:49] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-20 22:14:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025025-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(GT s30 s91), p0:(AND (GT s30 s91) (GT s47 s6)), p1:(GT s47 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 301 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RefineWMG-PT-025025-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-025025-LTLCardinality-15 finished in 914 ms.
All properties solved by simple procedures.
Total runtime 11823 ms.

BK_STOP 1653084889729

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-025025"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-025025, 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 r186-tajo-165281572400539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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