Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241600283.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 90K 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 SmartHome-PT-12-LTLCardinality-00
FORMULA_NAME SmartHome-PT-12-LTLCardinality-01
FORMULA_NAME SmartHome-PT-12-LTLCardinality-02
FORMULA_NAME SmartHome-PT-12-LTLCardinality-03
FORMULA_NAME SmartHome-PT-12-LTLCardinality-04
FORMULA_NAME SmartHome-PT-12-LTLCardinality-05
FORMULA_NAME SmartHome-PT-12-LTLCardinality-06
FORMULA_NAME SmartHome-PT-12-LTLCardinality-07
FORMULA_NAME SmartHome-PT-12-LTLCardinality-08
FORMULA_NAME SmartHome-PT-12-LTLCardinality-09
FORMULA_NAME SmartHome-PT-12-LTLCardinality-10
FORMULA_NAME SmartHome-PT-12-LTLCardinality-11
FORMULA_NAME SmartHome-PT-12-LTLCardinality-12
FORMULA_NAME SmartHome-PT-12-LTLCardinality-13
FORMULA_NAME SmartHome-PT-12-LTLCardinality-14
FORMULA_NAME SmartHome-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653108720730

Running Version 202205111006
[2022-05-21 04:52:02] [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-21 04:52:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:52:02] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-21 04:52:02] [INFO ] Transformed 376 places.
[2022-05-21 04:52:02] [INFO ] Transformed 399 transitions.
[2022-05-21 04:52:02] [INFO ] Found NUPN structural information;
[2022-05-21 04:52:02] [INFO ] Parsed PT model containing 376 places and 399 transitions in 350 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 104 places in 6 ms
Reduce places removed 104 places and 80 transitions.
FORMULA SmartHome-PT-12-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 319/319 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 264 transition count 319
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 76 place count 196 transition count 251
Iterating global reduction 1 with 68 rules applied. Total rules applied 144 place count 196 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 152 place count 196 transition count 243
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 165 place count 183 transition count 230
Iterating global reduction 2 with 13 rules applied. Total rules applied 178 place count 183 transition count 230
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 191 place count 170 transition count 217
Iterating global reduction 2 with 13 rules applied. Total rules applied 204 place count 170 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 206 place count 170 transition count 215
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 210 place count 166 transition count 211
Iterating global reduction 3 with 4 rules applied. Total rules applied 214 place count 166 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 215 place count 165 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 165 transition count 210
Applied a total of 216 rules in 114 ms. Remains 165 /272 variables (removed 107) and now considering 210/319 (removed 109) transitions.
// Phase 1: matrix 210 rows 165 cols
[2022-05-21 04:52:03] [INFO ] Computed 5 place invariants in 27 ms
[2022-05-21 04:52:03] [INFO ] Implicit Places using invariants in 311 ms returned []
// Phase 1: matrix 210 rows 165 cols
[2022-05-21 04:52:03] [INFO ] Computed 5 place invariants in 7 ms
[2022-05-21 04:52:03] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 165 cols
[2022-05-21 04:52:03] [INFO ] Computed 5 place invariants in 12 ms
[2022-05-21 04:52:04] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/272 places, 210/319 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/272 places, 210/319 transitions.
Support contains 22 out of 165 places after structural reductions.
[2022-05-21 04:52:04] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 04:52:04] [INFO ] Flatten gal took : 73 ms
FORMULA SmartHome-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:52:04] [INFO ] Flatten gal took : 31 ms
[2022-05-21 04:52:04] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 20 out of 165 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 210 rows 165 cols
[2022-05-21 04:52:05] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-21 04:52:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-21 04:52:05] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:52:05] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-21 04:52:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-21 04:52:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:52:05] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-21 04:52:06] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2022-05-21 04:52:06] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 7 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 165/165 places, 210/210 transitions.
Graph (trivial) has 167 edges and 165 vertex of which 91 / 165 are part of one of the 7 SCC in 12 ms
Free SCC test removed 84 places
Drop transitions removed 121 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 126 transitions.
Graph (complete) has 117 edges and 81 vertex of which 67 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.12 ms
Discarding 14 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 67 transition count 34
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 82 place count 35 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 83 place count 34 transition count 28
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 91 place count 30 transition count 28
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 28 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 28 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 27 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 27 transition count 25
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 121 place count 15 transition count 13
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 19 edges and 15 vertex of which 11 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 3 with 6 rules applied. Total rules applied 127 place count 11 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 128 place count 10 transition count 6
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 132 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 133 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 133 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 135 place count 5 transition count 4
Applied a total of 135 rules in 54 ms. Remains 5 /165 variables (removed 160) and now considering 4/210 (removed 206) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/165 places, 4/210 transitions.
Finished random walk after 6 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
FORMULA SmartHome-PT-12-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA SmartHome-PT-12-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 39 stable transitions
Graph (complete) has 259 edges and 165 vertex of which 163 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||X(X(X((F(p1)||p2))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 164 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 159 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 159 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 157 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 157 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 155 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 153 transition count 199
Applied a total of 23 rules in 33 ms. Remains 153 /165 variables (removed 12) and now considering 199/210 (removed 11) transitions.
// Phase 1: matrix 199 rows 153 cols
[2022-05-21 04:52:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-21 04:52:06] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 199 rows 153 cols
[2022-05-21 04:52:06] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-21 04:52:06] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 199 rows 153 cols
[2022-05-21 04:52:06] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-21 04:52:06] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/165 places, 199/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/165 places, 199/210 transitions.
Stuttering acceptance computed with spot in 367 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=0, aps=[p0:(AND (EQ s118 0) (EQ s144 1)), p2:(EQ s67 1), p1:(AND (EQ s49 0) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 248 steps with 0 reset in 13 ms.
FORMULA SmartHome-PT-12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-01 finished in 1059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(X(F(X(p0))))))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 210
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 158 transition count 205
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 155 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 152 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 152 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 150 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 150 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 149 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 149 transition count 196
Applied a total of 30 rules in 27 ms. Remains 149 /165 variables (removed 16) and now considering 196/210 (removed 14) transitions.
// Phase 1: matrix 196 rows 149 cols
[2022-05-21 04:52:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:52:07] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 196 rows 149 cols
[2022-05-21 04:52:07] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-21 04:52:07] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 196 rows 149 cols
[2022-05-21 04:52:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/165 places, 196/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/165 places, 196/210 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-06 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: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (EQ s125 0) (EQ s14 1) (EQ s62 0) (EQ s123 1) (EQ s63 1))], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-06 finished in 678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F(p0)||F(X(X(p0)))) U F(G(p0)))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Graph (trivial) has 163 edges and 165 vertex of which 84 / 165 are part of one of the 7 SCC in 1 ms
Free SCC test removed 77 places
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Graph (complete) has 151 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 85 transition count 71
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 52 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 51 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 50 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 73 place count 50 transition count 65
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 47 transition count 65
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 83 place count 43 transition count 61
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 43 transition count 61
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 119 place count 27 transition count 45
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 130 place count 27 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 131 place count 26 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 26 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 25 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 25 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 23 transition count 31
Applied a total of 137 rules in 25 ms. Remains 23 /165 variables (removed 142) and now considering 31/210 (removed 179) transitions.
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:52:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:52:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-21 04:52:08] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 04:52:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:52:08] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/165 places, 31/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/165 places, 31/210 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s7 1))], 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 24 steps with 1 reset in 0 ms.
FORMULA SmartHome-PT-12-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-10 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(!p0)))'
Support contains 1 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 210
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 157 transition count 204
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 157 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 153 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 153 transition count 200
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 149 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 149 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 147 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 147 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 146 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 146 transition count 193
Applied a total of 36 rules in 13 ms. Remains 146 /165 variables (removed 19) and now considering 193/210 (removed 17) transitions.
// Phase 1: matrix 193 rows 146 cols
[2022-05-21 04:52:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 193 rows 146 cols
[2022-05-21 04:52:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 146 cols
[2022-05-21 04:52:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:08] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/165 places, 193/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/165 places, 193/210 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s122 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 SmartHome-PT-12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-11 finished in 498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Graph (trivial) has 162 edges and 165 vertex of which 80 / 165 are part of one of the 6 SCC in 0 ms
Free SCC test removed 74 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Graph (complete) has 157 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 89 transition count 75
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 55 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 54 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 73 place count 54 transition count 70
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 51 transition count 70
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 46 transition count 65
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 46 transition count 65
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 131 place count 25 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 25 transition count 40
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 144 place count 25 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 146 place count 23 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 146 place count 23 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 21 transition count 26
Applied a total of 149 rules in 38 ms. Remains 21 /165 variables (removed 144) and now considering 26/210 (removed 184) transitions.
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:52:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:52:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:52:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2022-05-21 04:52:08] [INFO ] Redundant transitions in 28 ms returned []
[2022-05-21 04:52:08] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 21 cols
[2022-05-21 04:52:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:52:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/165 places, 26/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/165 places, 26/210 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s4 1))], 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 6 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-12-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-12 finished in 475 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(G(p0)) U X(p1)))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 210/210 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 159 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 159 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 157 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 157 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 155 transition count 202
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 154 transition count 201
Applied a total of 20 rules in 14 ms. Remains 154 /165 variables (removed 11) and now considering 201/210 (removed 9) transitions.
// Phase 1: matrix 201 rows 154 cols
[2022-05-21 04:52:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:09] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 201 rows 154 cols
[2022-05-21 04:52:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:09] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 201 rows 154 cols
[2022-05-21 04:52:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:52:09] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/165 places, 201/210 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/165 places, 201/210 transitions.
Stuttering acceptance computed with spot in 288 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : SmartHome-PT-12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s76 1), p1:(OR (EQ s90 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-12-LTLCardinality-14 finished in 892 ms.
All properties solved by simple procedures.
Total runtime 7639 ms.

BK_STOP 1653108730313

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-12"
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 SmartHome-PT-12, 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 r240-smll-165303241600283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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