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-165281572500579.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-100101, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572500579
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 02:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 02:22 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.8K May 9 08:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:38 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 218K 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-100101-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-100101-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653087195358

Running Version 202205111006
[2022-05-20 22:53:16] [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:53:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 22:53:17] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2022-05-20 22:53:17] [INFO ] Transformed 504 places.
[2022-05-20 22:53:17] [INFO ] Transformed 403 transitions.
[2022-05-20 22:53:17] [INFO ] Parsed PT model containing 504 places and 403 transitions in 281 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-100101-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 66 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:17] [INFO ] Computed 202 place invariants in 12 ms
[2022-05-20 22:53:18] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:18] [INFO ] Computed 202 place invariants in 14 ms
[2022-05-20 22:53:18] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:18] [INFO ] Computed 202 place invariants in 18 ms
[2022-05-20 22:53:18] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:18] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:19] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Support contains 29 out of 504 places after structural reductions.
[2022-05-20 22:53:19] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-20 22:53:19] [INFO ] Flatten gal took : 101 ms
FORMULA RefineWMG-PT-100101-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-100101-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 22:53:19] [INFO ] Flatten gal took : 71 ms
[2022-05-20 22:53:19] [INFO ] Input system was already deterministic with 403 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:20] [INFO ] Computed 202 place invariants in 43 ms
[2022-05-20 22:53:21] [INFO ] After 371ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-20 22:53:21] [INFO ] [Nat]Absence check using 202 positive place invariants in 58 ms returned sat
[2022-05-20 22:53:22] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-20 22:53:23] [INFO ] After 1266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 307 ms.
[2022-05-20 22:53:23] [INFO ] After 2260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Finished Parikh walk after 2602 steps, including 0 resets, run visited all 1 properties in 45 ms. (steps per millisecond=57 )
Parikh walk visited 13 properties in 4153 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' '!(F(X(F(X(X(F(p0)))))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 15 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:27] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:53:28] [INFO ] Dead Transitions using invariants and state equation in 342 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:28] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:53:28] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:28] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:53:28] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:28] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:29] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (LEQ s487 s182) (OR (LEQ s212 s257) (LEQ 1 s483)))], 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][false, false, false, false]]
Product exploration explored 100000 steps with 7509 reset in 1024 ms.
Stack based approach found an accepted trace after 404 steps with 65 reset with depth 72 and stack size 72 in 4 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-00 finished in 2580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 8 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:30] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:30] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:30] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:30] [INFO ] Computed 202 place invariants in 3 ms
[2022-05-20 22:53:31] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s100 s79)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-06 finished in 1115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 6 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:31] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:31] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:53:31] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:31] [INFO ] Computed 202 place invariants in 5 ms
[2022-05-20 22:53:32] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:32] [INFO ] Computed 202 place invariants in 8 ms
[2022-05-20 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s48 s262)], 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 0 reset in 1169 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-07 finished in 2191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 298 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 9 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 1 with 300 rules applied. Total rules applied 399 place count 106 transition count 106
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 1 with 97 rules applied. Total rules applied 496 place count 106 transition count 9
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 2 with 97 rules applied. Total rules applied 593 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 593 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 595 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 597 place count 7 transition count 7
Applied a total of 597 rules in 51 ms. Remains 7 /504 variables (removed 497) and now considering 7/403 (removed 396) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:53:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:53:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:53:33] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:53:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 22:53:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 22:53:33] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-20 22:53:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/504 places, 7/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/504 places, 7/403 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-08 finished in 223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&p1)))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 15 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:33] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-20 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:34] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:34] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:34] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:34] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:34] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GT s357 s445), p1:(GT s174 s84)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-09 finished in 1246 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((F(p0)||p0) U G((p0 U p1))))'
Support contains 4 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 297 edges and 504 vertex of which 200 / 504 are part of one of the 100 SCC in 1 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 304 transition count 204
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Reduce places removed 194 places and 0 transitions.
Iterating global reduction 1 with 291 rules applied. Total rules applied 391 place count 110 transition count 107
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 1 with 90 rules applied. Total rules applied 481 place count 110 transition count 17
Reduce places removed 90 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 91 rules applied. Total rules applied 572 place count 20 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 573 place count 19 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 573 place count 19 transition count 13
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 579 place count 16 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 581 place count 15 transition count 12
Applied a total of 581 rules in 28 ms. Remains 15 /504 variables (removed 489) and now considering 12/403 (removed 391) transitions.
// Phase 1: matrix 12 rows 15 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 12 rows 15 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-20 22:53:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 15 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/504 places, 12/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/504 places, 12/403 transitions.
Stuttering acceptance computed with spot in 86 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s9 s11), p1:(LEQ s14 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-11 finished in 368 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 296 edges and 504 vertex of which 198 / 504 are part of one of the 99 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 306 transition count 206
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 1 with 294 rules applied. Total rules applied 393 place count 110 transition count 108
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 1 with 94 rules applied. Total rules applied 487 place count 110 transition count 14
Reduce places removed 94 places and 0 transitions.
Iterating post reduction 2 with 94 rules applied. Total rules applied 581 place count 16 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 581 place count 16 transition count 11
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 587 place count 13 transition count 11
Applied a total of 587 rules in 11 ms. Remains 13 /504 variables (removed 491) and now considering 11/403 (removed 392) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-20 22:53:35] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-20 22:53:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/504 places, 11/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/504 places, 11/403 transitions.
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-100101-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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(LEQ s12 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-13 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(!X(p0)) U X(p1)))||G(X(p2)))))'
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:35] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:35] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:36] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:36] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:36] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:36] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:36] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 3}]], initial=7, aps=[p1:(LEQ s253 s86), p0:(LEQ s240 s276), p2:(LEQ 3 s392)], 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 614 ms.
Product exploration explored 100000 steps with 25000 reset in 824 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 p0 p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 9 states, 16 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 297 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10004 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:39] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:39] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 22:53:39] [INFO ] [Nat]Absence check using 202 positive place invariants in 35 ms returned sat
[2022-05-20 22:53:39] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-20 22:53:39] [INFO ] After 446ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 155 ms.
[2022-05-20 22:53:40] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 21536 steps, including 0 resets, run visited all 1 properties in 135 ms. (steps per millisecond=159 )
Parikh walk visited 6 properties in 2996 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 242 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 210 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:43] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:44] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:44] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:44] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:44] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:44] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:44] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:44] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
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 p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 296 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 83354 steps, run timeout after 3072 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83354 steps, saw 81286 distinct states, run finished after 3073 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:53:48] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:53:48] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 22:53:49] [INFO ] [Nat]Absence check using 202 positive place invariants in 22 ms returned sat
[2022-05-20 22:53:49] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 22:53:49] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 234 ms.
[2022-05-20 22:53:50] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 20939 steps, including 0 resets, run visited all 4 properties in 824 ms. (steps per millisecond=25 )
Parikh walk visited 9 properties in 2824 ms.
Knowledge obtained : [(AND p0 p1 p2), true]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 8 states, 14 edges and 3 AP to 8 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 25000 reset in 630 ms.
Product exploration explored 100000 steps with 25000 reset in 683 ms.
Applying partial POR strategy [true, true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[true, (OR (NOT p1) p0), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 504 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Graph (trivial) has 293 edges and 504 vertex of which 196 / 504 are part of one of the 98 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 308 transition count 208
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 97 places in 0 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 195 place count 308 transition count 208
Deduced a syphon composed of 97 places in 0 ms
Applied a total of 195 rules in 72 ms. Remains 308 /504 variables (removed 196) and now considering 208/403 (removed 195) transitions.
// Phase 1: matrix 208 rows 308 cols
[2022-05-20 22:53:55] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-20 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
[2022-05-20 22:53:55] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 208 rows 308 cols
[2022-05-20 22:53:55] [INFO ] Computed 104 place invariants in 1 ms
[2022-05-20 22:53:55] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/504 places, 208/403 transitions.
Finished structural reductions, in 1 iterations. Remains : 308/504 places, 208/403 transitions.
Product exploration explored 100000 steps with 25000 reset in 766 ms.
Product exploration explored 100000 steps with 25000 reset in 802 ms.
Built C files in :
/tmp/ltsmin5243873669763408470
[2022-05-20 22:53:57] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5243873669763408470
Running compilation step : cd /tmp/ltsmin5243873669763408470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 855 ms.
Running link step : cd /tmp/ltsmin5243873669763408470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin5243873669763408470;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3185871356502630460.hoa' '--buchi-type=spotba'
LTSmin run took 13185 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-100101-LTLCardinality-14 finished in 35688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))&&X(p1)))'
Support contains 3 out of 504 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 504/504 places, 403/403 transitions.
Applied a total of 0 rules in 5 ms. Remains 504 /504 variables (removed 0) and now considering 403/403 (removed 0) transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:11] [INFO ] Computed 202 place invariants in 0 ms
[2022-05-20 22:54:11] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:11] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:11] [INFO ] Computed 202 place invariants in 1 ms
[2022-05-20 22:54:12] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
// Phase 1: matrix 403 rows 504 cols
[2022-05-20 22:54:12] [INFO ] Computed 202 place invariants in 0 ms
[2022-05-20 22:54:12] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 504/504 places, 403/403 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-100101-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s381 s256), p0:(GT 1 s291)], 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 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-100101-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-100101-LTLCardinality-15 finished in 971 ms.
All properties solved by simple procedures.
Total runtime 55507 ms.

BK_STOP 1653087252484

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-100101"
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-100101, 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-165281572500579"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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