Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416200676.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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-050050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416200676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 110K May 5 16:51 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-050050-00
FORMULA_NAME RefineWMG-PT-050050-01
FORMULA_NAME RefineWMG-PT-050050-02
FORMULA_NAME RefineWMG-PT-050050-03
FORMULA_NAME RefineWMG-PT-050050-04
FORMULA_NAME RefineWMG-PT-050050-05
FORMULA_NAME RefineWMG-PT-050050-06
FORMULA_NAME RefineWMG-PT-050050-07
FORMULA_NAME RefineWMG-PT-050050-08
FORMULA_NAME RefineWMG-PT-050050-09
FORMULA_NAME RefineWMG-PT-050050-10
FORMULA_NAME RefineWMG-PT-050050-11
FORMULA_NAME RefineWMG-PT-050050-12
FORMULA_NAME RefineWMG-PT-050050-13
FORMULA_NAME RefineWMG-PT-050050-14
FORMULA_NAME RefineWMG-PT-050050-15

=== Now, execution of the tool begins

BK_START 1621263270734

Running Version 0
[2021-05-17 14:54:33] [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]
[2021-05-17 14:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:54:33] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-17 14:54:33] [INFO ] Transformed 254 places.
[2021-05-17 14:54:33] [INFO ] Transformed 203 transitions.
[2021-05-17 14:54:33] [INFO ] Parsed PT model containing 254 places and 203 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:54:33] [INFO ] Initial state test concluded for 5 properties.
FORMULA RefineWMG-PT-050050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-050050-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 36 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:33] [INFO ] Computed 102 place invariants in 11 ms
[2021-05-17 14:54:33] [INFO ] Dead Transitions using invariants and state equation in 319 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:33] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-17 14:54:33] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:33] [INFO ] Computed 102 place invariants in 15 ms
[2021-05-17 14:54:33] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:33] [INFO ] Computed 102 place invariants in 6 ms
[2021-05-17 14:54:34] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
[2021-05-17 14:54:34] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:54:34] [INFO ] Flatten gal took : 54 ms
FORMULA RefineWMG-PT-050050-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:54:34] [INFO ] Flatten gal took : 16 ms
[2021-05-17 14:54:34] [INFO ] Input system was already deterministic with 203 transitions.
Incomplete random walk after 100018 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=549 ) properties (out of 24) seen :15
Running SMT prover for 9 properties.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:34] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:34] [INFO ] [Real]Absence check using 102 positive place invariants in 10 ms returned sat
[2021-05-17 14:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-17 14:54:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:34] [INFO ] [Nat]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 14:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:34] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-17 14:54:34] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:54:35] [INFO ] Added : 143 causal constraints over 29 iterations in 343 ms. Result :sat
[2021-05-17 14:54:35] [INFO ] [Real]Absence check using 102 positive place invariants in 13 ms returned sat
[2021-05-17 14:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:35] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 14:54:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 12 ms returned sat
[2021-05-17 14:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:35] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 14:54:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-17 14:54:35] [INFO ] Added : 125 causal constraints over 25 iterations in 290 ms. Result :sat
[2021-05-17 14:54:35] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:35] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-17 14:54:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:35] [INFO ] [Nat]Absence check using 102 positive place invariants in 13 ms returned sat
[2021-05-17 14:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:35] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 14:54:35] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 14:54:36] [INFO ] Added : 104 causal constraints over 21 iterations in 229 ms. Result :sat
[2021-05-17 14:54:36] [INFO ] [Real]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-17 14:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-17 14:54:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-17 14:54:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 13 ms.
[2021-05-17 14:54:36] [INFO ] Added : 116 causal constraints over 24 iterations in 313 ms. Result :sat
[2021-05-17 14:54:36] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:36] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-17 14:54:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:36] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 14:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:36] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-17 14:54:36] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 14:54:37] [INFO ] Added : 95 causal constraints over 19 iterations in 233 ms. Result :sat
[2021-05-17 14:54:37] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:37] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-17 14:54:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:37] [INFO ] [Nat]Absence check using 102 positive place invariants in 18 ms returned sat
[2021-05-17 14:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:37] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-17 14:54:37] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 14:54:37] [INFO ] Added : 122 causal constraints over 25 iterations in 333 ms. Result :sat
[2021-05-17 14:54:37] [INFO ] [Real]Absence check using 102 positive place invariants in 15 ms returned sat
[2021-05-17 14:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:37] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-17 14:54:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 14:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:38] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-17 14:54:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:54:38] [INFO ] Added : 118 causal constraints over 24 iterations in 337 ms. Result :sat
[2021-05-17 14:54:38] [INFO ] [Real]Absence check using 102 positive place invariants in 22 ms returned sat
[2021-05-17 14:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:38] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 14:54:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:38] [INFO ] [Nat]Absence check using 102 positive place invariants in 17 ms returned sat
[2021-05-17 14:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:38] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-17 14:54:38] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 14:54:39] [INFO ] Added : 104 causal constraints over 21 iterations in 255 ms. Result :sat
[2021-05-17 14:54:39] [INFO ] [Real]Absence check using 102 positive place invariants in 21 ms returned sat
[2021-05-17 14:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:39] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-17 14:54:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:54:39] [INFO ] [Nat]Absence check using 102 positive place invariants in 24 ms returned sat
[2021-05-17 14:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:54:39] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-17 14:54:39] [INFO ] Computed and/alt/rep : 152/202/152 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:54:39] [INFO ] Added : 115 causal constraints over 23 iterations in 287 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 4 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 197 place count 60 transition count 60
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 240 place count 60 transition count 17
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 283 place count 17 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 283 place count 17 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 289 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 13 transition count 13
Applied a total of 291 rules in 42 ms. Remains 13 /254 variables (removed 241) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:54:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:39] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 14:54:39] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:54:39] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-17 14:54:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:54:39] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s8 s12), p1:(GT 3 s5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 384 steps with 0 reset in 4 ms.
FORMULA RefineWMG-PT-050050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-00 finished in 353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 194 place count 58 transition count 56
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 236 place count 58 transition count 14
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 43 rules applied. Total rules applied 279 place count 16 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 280 place count 15 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 280 place count 15 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 284 place count 13 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 286 place count 12 transition count 10
Applied a total of 286 rules in 13 ms. Remains 12 /254 variables (removed 242) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:54:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:54:40] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:54:40] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 14:54:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:54:40] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-01 automaton TGBA [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=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s6), p1:(GT s11 s8)], 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-050050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-01 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 146 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 193 place count 60 transition count 58
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 1 with 43 rules applied. Total rules applied 236 place count 60 transition count 15
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 279 place count 17 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 279 place count 17 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 285 place count 14 transition count 12
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 287 place count 13 transition count 11
Applied a total of 287 rules in 11 ms. Remains 13 /254 variables (removed 241) and now considering 11/203 (removed 192) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:54:40] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:54:40] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:54:40] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-17 14:54:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:54:40] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-050050-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s12 s8), p1:(GT s6 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-02 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 142 edges and 254 vertex of which 92 / 254 are part of one of the 46 SCC in 0 ms
Free SCC test removed 46 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 162 transition count 112
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 196 place count 62 transition count 62
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 1 with 41 rules applied. Total rules applied 237 place count 62 transition count 21
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 278 place count 21 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 278 place count 21 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 286 place count 17 transition count 17
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 288 place count 16 transition count 16
Applied a total of 288 rules in 8 ms. Remains 16 /254 variables (removed 238) and now considering 16/203 (removed 187) transitions.
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:54:40] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:54:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:54:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:54:40] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-17 14:54:40] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2021-05-17 14:54:40] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:54:40] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/254 places, 16/203 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-03 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s12), p2:(GT s14 s6), p1:(LEQ 1 s8)], 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-050050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-03 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 1 with 42 rules applied. Total rules applied 238 place count 58 transition count 15
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 43 rules applied. Total rules applied 281 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 282 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 13 transition count 12
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 288 place count 12 transition count 11
Applied a total of 288 rules in 14 ms. Remains 12 /254 variables (removed 242) and now considering 11/203 (removed 192) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:54:40] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:41] [INFO ] Dead Transitions using invariants and state equation in 513 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:54:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:54:41] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:54:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-17 14:54:41] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:54:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/254 places, 11/203 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 1 s5) (GT s11 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-04 finished in 663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:41] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:41] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:41] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:41] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:41] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:54:41] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:41] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:42] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : RefineWMG-PT-050050-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT s131 s153), p0:(LEQ 1 s157)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 746 ms.
Entered a terminal (fully accepting) state of product in 60078 steps with 0 reset in 575 ms.
FORMULA RefineWMG-PT-050050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-05 finished in 2059 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 150 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 200 place count 54 transition count 54
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 1 with 40 rules applied. Total rules applied 240 place count 54 transition count 14
Reduce places removed 40 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 43 rules applied. Total rules applied 283 place count 14 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 286 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 286 place count 11 transition count 10
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 288 place count 10 transition count 10
Applied a total of 288 rules in 11 ms. Remains 10 /254 variables (removed 244) and now considering 10/203 (removed 193) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:54:43] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:54:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:54:43] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 10/203 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (LEQ 2 s9) (LEQ s7 s5)), p0:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-06 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 147 edges and 254 vertex of which 98 / 254 are part of one of the 49 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 156 transition count 106
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 1 with 147 rules applied. Total rules applied 196 place count 58 transition count 57
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 1 with 45 rules applied. Total rules applied 241 place count 58 transition count 12
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 2 with 45 rules applied. Total rules applied 286 place count 13 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 286 place count 13 transition count 10
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 290 place count 11 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 292 place count 10 transition count 9
Applied a total of 292 rules in 10 ms. Remains 10 /254 variables (removed 244) and now considering 9/203 (removed 194) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:54:43] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:54:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:43] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/254 places, 9/203 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-050050-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5), p1:(LEQ 3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-07 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:43] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:44] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:44] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:44] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:44] [INFO ] Computed 102 place invariants in 6 ms
[2021-05-17 14:54:44] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:44] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:44] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-050050-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s219 s14), p0:(GT 2 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 769 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA RefineWMG-PT-050050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-09 finished in 1487 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 1 with 144 rules applied. Total rules applied 194 place count 58 transition count 56
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 1 with 38 rules applied. Total rules applied 232 place count 58 transition count 18
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 41 rules applied. Total rules applied 273 place count 20 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 276 place count 17 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 276 place count 17 transition count 14
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 278 place count 16 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 280 place count 15 transition count 13
Applied a total of 280 rules in 8 ms. Remains 15 /254 variables (removed 239) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:54:45] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:54:45] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:54:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:54:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 14:54:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 15 cols
[2021-05-17 14:54:45] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-050050-10 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s12 s10), p0:(GT s8 s6), p2:(GT 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-050050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-10 finished in 231 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U p1))], workingDir=/home/mcc/execution]
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 144 edges and 254 vertex of which 94 / 254 are part of one of the 47 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 160 transition count 110
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 1 with 150 rules applied. Total rules applied 197 place count 60 transition count 60
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 1 with 44 rules applied. Total rules applied 241 place count 60 transition count 16
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 2 with 44 rules applied. Total rules applied 285 place count 16 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 285 place count 16 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 14 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 291 place count 13 transition count 13
Applied a total of 291 rules in 8 ms. Remains 13 /254 variables (removed 241) and now considering 13/203 (removed 190) transitions.
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:54:45] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 13 rows 13 cols
[2021-05-17 14:54:45] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:54:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/254 places, 13/203 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-050050-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s9 s11), p0:(LEQ 1 s5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-050050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-050050-12 finished in 176 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Applied a total of 0 rules in 2 ms. Remains 254 /254 variables (removed 0) and now considering 203/203 (removed 0) transitions.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:45] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:54:45] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:45] [INFO ] Computed 102 place invariants in 2 ms
[2021-05-17 14:54:45] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:45] [INFO ] Computed 102 place invariants in 1 ms
[2021-05-17 14:54:46] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 203 rows 254 cols
[2021-05-17 14:54:46] [INFO ] Computed 102 place invariants in 4 ms
[2021-05-17 14:54:46] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 203/203 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-050050-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(GT 3 s196), p0:(LEQ 2 s141)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 579 ms.
Product exploration explored 100000 steps with 0 reset in 773 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 557 ms.
Product exploration explored 100000 steps with 0 reset in 870 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Support contains 2 out of 254 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 254/254 places, 203/203 transitions.
Graph (trivial) has 148 edges and 254 vertex of which 100 / 254 are part of one of the 50 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 154 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 98 place count 154 transition count 104
Deduced a syphon composed of 48 places in 1 ms
Applied a total of 98 rules in 23 ms. Remains 154 /254 variables (removed 100) and now considering 104/203 (removed 99) transitions.
// Phase 1: matrix 104 rows 154 cols
[2021-05-17 14:54:49] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:54:50] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
[2021-05-17 14:54:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 104 rows 154 cols
[2021-05-17 14:54:50] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:54:50] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 154/254 places, 104/203 transitions.
Product exploration explored 100000 steps with 0 reset in 767 ms.
Product exploration explored 100000 steps with 0 reset in 952 ms.
[2021-05-17 14:54:51] [INFO ] Flatten gal took : 11 ms
[2021-05-17 14:54:51] [INFO ] Flatten gal took : 26 ms
[2021-05-17 14:54:51] [INFO ] Time to serialize gal into /tmp/LTL14095932361597291026.gal : 20 ms
[2021-05-17 14:54:51] [INFO ] Time to serialize properties into /tmp/LTL17837834819691348446.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14095932361597291026.gal, -t, CGAL, -LTL, /tmp/LTL17837834819691348446.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14095932361597291026.gal -t CGAL -LTL /tmp/LTL17837834819691348446.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p138>=2)")||(X(G("(p193<3)"))))))))
Formula 0 simplified : !XXG("(p138>=2)" | XG"(p193<3)")
Detected timeout of ITS tools.
[2021-05-17 14:55:07] [INFO ] Flatten gal took : 30 ms
[2021-05-17 14:55:07] [INFO ] Applying decomposition
[2021-05-17 14:55:07] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5720234322344334238.txt, -o, /tmp/graph5720234322344334238.bin, -w, /tmp/graph5720234322344334238.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5720234322344334238.bin, -l, -1, -v, -w, /tmp/graph5720234322344334238.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:55:07] [INFO ] Decomposing Gal with order
[2021-05-17 14:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:55:07] [INFO ] Flatten gal took : 52 ms
[2021-05-17 14:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 14:55:07] [INFO ] Time to serialize gal into /tmp/LTL15231464054271546358.gal : 6 ms
[2021-05-17 14:55:07] [INFO ] Time to serialize properties into /tmp/LTL5747742243324115949.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15231464054271546358.gal, -t, CGAL, -LTL, /tmp/LTL5747742243324115949.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15231464054271546358.gal -t CGAL -LTL /tmp/LTL5747742243324115949.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i16.i0.u67.p138>=2)")||(X(G("(i22.u93.p193<3)"))))))))
Formula 0 simplified : !XXG("(i16.i0.u67.p138>=2)" | XG"(i22.u93.p193<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13005874355177011461
[2021-05-17 14:55:22] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13005874355177011461
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13005874355177011461]
Compilation finished in 910 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13005874355177011461]
Link finished in 57 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13005874355177011461]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-050050-13 finished in 51598 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11882522640104996429
[2021-05-17 14:55:37] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2021-05-17 14:55:37] [INFO ] Applying decomposition
[2021-05-17 14:55:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 14:55:37] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2021-05-17 14:55:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 14:55:37] [INFO ] Flatten gal took : 9 ms
[2021-05-17 14:55:37] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2021-05-17 14:55:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 14:55:37] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11882522640104996429
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11882522640104996429]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3312465461763368409.txt, -o, /tmp/graph3312465461763368409.bin, -w, /tmp/graph3312465461763368409.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3312465461763368409.bin, -l, -1, -v, -w, /tmp/graph3312465461763368409.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:55:37] [INFO ] Decomposing Gal with order
[2021-05-17 14:55:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:55:37] [INFO ] Flatten gal took : 25 ms
[2021-05-17 14:55:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 14:55:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5483722694273647942.gal : 10 ms
[2021-05-17 14:55:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality11414815837894859698.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality5483722694273647942.gal, -t, CGAL, -LTL, /tmp/LTLCardinality11414815837894859698.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality5483722694273647942.gal -t CGAL -LTL /tmp/LTLCardinality11414815837894859698.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(i15.i2.u66.p138>=2)")||(X(G("(i22.i0.u94.p193<3)"))))))))
Formula 0 simplified : !XXG("(i15.i2.u66.p138>=2)" | XG"(i22.i0.u94.p193<3)")
Compilation finished in 868 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11882522640104996429]
Link finished in 60 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11882522640104996429]
WARNING : LTSmin timed out (>300 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11882522640104996429]
Retrying LTSmin with larger timeout 2400 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11882522640104996429]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: LTL layer: formula: X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: "X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.207: DFS-FIFO for weak LTL, using special progress label 206
pins2lts-mc-linux64( 0/ 8), 0.208: There are 207 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.208: State length is 255, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.208: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.208: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.208: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.208: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.486: ~1 levels ~960 states ~50784 transitions
pins2lts-mc-linux64( 7/ 8), 0.529: ~1 levels ~1920 states ~101680 transitions
pins2lts-mc-linux64( 7/ 8), 0.605: ~1 levels ~3840 states ~205248 transitions
pins2lts-mc-linux64( 7/ 8), 0.795: ~1 levels ~7680 states ~411880 transitions
pins2lts-mc-linux64( 2/ 8), 1.159: ~1 levels ~15360 states ~828752 transitions
pins2lts-mc-linux64( 0/ 8), 1.908: ~1 levels ~30720 states ~1649960 transitions
pins2lts-mc-linux64( 0/ 8), 3.154: ~1 levels ~61440 states ~3308648 transitions
pins2lts-mc-linux64( 3/ 8), 6.150: ~1 levels ~122880 states ~6705568 transitions
pins2lts-mc-linux64( 2/ 8), 12.487: ~1 levels ~245760 states ~13465456 transitions
pins2lts-mc-linux64( 3/ 8), 24.294: ~1 levels ~491520 states ~27142632 transitions
pins2lts-mc-linux64( 5/ 8), 49.451: ~1 levels ~983040 states ~54387344 transitions
pins2lts-mc-linux64( 5/ 8), 99.264: ~1 levels ~1966080 states ~109144392 transitions
pins2lts-mc-linux64( 7/ 8), 203.023: ~1 levels ~3932160 states ~218237496 transitions
pins2lts-mc-linux64( 7/ 8), 402.370: ~1 levels ~7864320 states ~439216776 transitions
pins2lts-mc-linux64( 2/ 8), 591.243: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 591.482:
pins2lts-mc-linux64( 0/ 8), 591.482: mean standard work distribution: 2.0% (states) 2.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 591.482:
pins2lts-mc-linux64( 0/ 8), 591.482: Explored 10963374 states 614862555 transitions, fanout: 56.083
pins2lts-mc-linux64( 0/ 8), 591.482: Total exploration time 591.230 sec (591.050 sec minimum, 591.154 sec on average)
pins2lts-mc-linux64( 0/ 8), 591.482: States per second: 18543, Transitions per second: 1039972
pins2lts-mc-linux64( 0/ 8), 591.482:
pins2lts-mc-linux64( 0/ 8), 591.482: Progress states detected: 134217117
pins2lts-mc-linux64( 0/ 8), 591.482: Redundant explorations: -91.8316
pins2lts-mc-linux64( 0/ 8), 591.482:
pins2lts-mc-linux64( 0/ 8), 591.482: Queue width: 8B, total height: 156143990, memory: 1191.28MB
pins2lts-mc-linux64( 0/ 8), 591.482: Tree memory: 1057.2MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 591.482: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 591.482: Stored 238 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 591.482: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 591.482: Est. total memory use: 2248.5MB (~2215.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11882522640104996429]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11882522640104996429]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 15:15:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 15:15:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality10989755127541897578.gal : 14 ms
[2021-05-17 15:15:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality6230063573985163371.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality10989755127541897578.gal, -t, CGAL, -LTL, /tmp/LTLCardinality6230063573985163371.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality10989755127541897578.gal -t CGAL -LTL /tmp/LTLCardinality6230063573985163371.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(G(("(p138>=2)")||(X(G("(p193<3)"))))))))
Formula 0 simplified : !XXG("(p138>=2)" | XG"(p193<3)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 15:36:19] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:36:19] [INFO ] Input system was already deterministic with 203 transitions.
[2021-05-17 15:36:19] [INFO ] Transformed 254 places.
[2021-05-17 15:36:19] [INFO ] Transformed 203 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 15:36:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality7611478494782394213.gal : 1 ms
[2021-05-17 15:36:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality2764417450872195366.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLCardinality7611478494782394213.gal, -t, CGAL, -LTL, /tmp/LTLCardinality2764417450872195366.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardinality7611478494782394213.gal -t CGAL -LTL /tmp/LTLCardinality2764417450872195366.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G(("(p138>=2)")||(X(G("(p193<3)"))))))))
Formula 0 simplified : !XXG("(p138>=2)" | XG"(p193<3)")

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-050050"
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-050050, 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 r178-tajo-162089416200676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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