fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r240-smll-165303241600275
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SmartHome-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
205.443 8019.00 17903.00 174.70 TFFFFFTFFFFFFTFT normal

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-165303241600275.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 15:42 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.3K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K 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 71K 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-11-LTLCardinality-00
FORMULA_NAME SmartHome-PT-11-LTLCardinality-01
FORMULA_NAME SmartHome-PT-11-LTLCardinality-02
FORMULA_NAME SmartHome-PT-11-LTLCardinality-03
FORMULA_NAME SmartHome-PT-11-LTLCardinality-04
FORMULA_NAME SmartHome-PT-11-LTLCardinality-05
FORMULA_NAME SmartHome-PT-11-LTLCardinality-06
FORMULA_NAME SmartHome-PT-11-LTLCardinality-07
FORMULA_NAME SmartHome-PT-11-LTLCardinality-08
FORMULA_NAME SmartHome-PT-11-LTLCardinality-09
FORMULA_NAME SmartHome-PT-11-LTLCardinality-10
FORMULA_NAME SmartHome-PT-11-LTLCardinality-11
FORMULA_NAME SmartHome-PT-11-LTLCardinality-12
FORMULA_NAME SmartHome-PT-11-LTLCardinality-13
FORMULA_NAME SmartHome-PT-11-LTLCardinality-14
FORMULA_NAME SmartHome-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653108451819

Running Version 202205111006
[2022-05-21 04:47:34] [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:47:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:47:34] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2022-05-21 04:47:34] [INFO ] Transformed 290 places.
[2022-05-21 04:47:34] [INFO ] Transformed 315 transitions.
[2022-05-21 04:47:34] [INFO ] Found NUPN structural information;
[2022-05-21 04:47:34] [INFO ] Parsed PT model containing 290 places and 315 transitions in 455 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 66 places in 7 ms
Reduce places removed 66 places and 55 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-11-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 260/260 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 216 transition count 260
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 61 place count 163 transition count 207
Iterating global reduction 1 with 53 rules applied. Total rules applied 114 place count 163 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 119 place count 163 transition count 202
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 154 transition count 193
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 154 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 146 place count 145 transition count 184
Iterating global reduction 2 with 9 rules applied. Total rules applied 155 place count 145 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 145 transition count 183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 141 transition count 179
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 141 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 140 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 140 transition count 178
Applied a total of 166 rules in 125 ms. Remains 140 /224 variables (removed 84) and now considering 178/260 (removed 82) transitions.
// Phase 1: matrix 178 rows 140 cols
[2022-05-21 04:47:35] [INFO ] Computed 4 place invariants in 16 ms
[2022-05-21 04:47:35] [INFO ] Implicit Places using invariants in 411 ms returned []
// Phase 1: matrix 178 rows 140 cols
[2022-05-21 04:47:35] [INFO ] Computed 4 place invariants in 9 ms
[2022-05-21 04:47:35] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
// Phase 1: matrix 178 rows 140 cols
[2022-05-21 04:47:35] [INFO ] Computed 4 place invariants in 13 ms
[2022-05-21 04:47:36] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/224 places, 178/260 transitions.
Finished structural reductions, in 1 iterations. Remains : 140/224 places, 178/260 transitions.
Support contains 16 out of 140 places after structural reductions.
[2022-05-21 04:47:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 04:47:36] [INFO ] Flatten gal took : 71 ms
[2022-05-21 04:47:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA SmartHome-PT-11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 04:47:36] [INFO ] Flatten gal took : 26 ms
[2022-05-21 04:47:36] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 178 rows 140 cols
[2022-05-21 04:47:37] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-21 04:47:37] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 04:47:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-21 04:47:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:47:37] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA SmartHome-PT-11-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
FORMULA SmartHome-PT-11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 34 stable transitions
Graph (complete) has 224 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 134 edges and 140 vertex of which 71 / 140 are part of one of the 6 SCC in 18 ms
Free SCC test removed 65 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 135 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 73 transition count 68
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 51 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 49 transition count 64
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 52 place count 49 transition count 60
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 45 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 41 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 41 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 41 transition count 55
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 99 place count 26 transition count 40
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 109 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 25 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 110 place count 25 transition count 29
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 112 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 22 transition count 28
Applied a total of 114 rules in 58 ms. Remains 22 /140 variables (removed 118) and now considering 28/178 (removed 150) transitions.
[2022-05-21 04:47:37] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:47:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-21 04:47:37] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:47:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-21 04:47:37] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-21 04:47:37] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-21 04:47:37] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 22 cols
[2022-05-21 04:47:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:37] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/140 places, 28/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/140 places, 28/178 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-03 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 s5 0) (EQ s2 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 23 steps with 1 reset in 3 ms.
FORMULA SmartHome-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-03 finished in 595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 138 edges and 140 vertex of which 71 / 140 are part of one of the 6 SCC in 0 ms
Free SCC test removed 65 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Graph (complete) has 135 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 73 transition count 65
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 48 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 45 transition count 59
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 61 place count 45 transition count 56
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 67 place count 42 transition count 56
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 72 place count 37 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 77 place count 37 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 37 transition count 50
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 100 place count 26 transition count 39
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 26 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 24 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 112 place count 24 transition count 28
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 114 place count 23 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 22 transition count 27
Applied a total of 115 rules in 22 ms. Remains 22 /140 variables (removed 118) and now considering 27/178 (removed 151) transitions.
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 04:47:38] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 04:47:38] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-21 04:47:38] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-21 04:47:38] [INFO ] Redundant transitions in 32 ms returned []
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 22 cols
[2022-05-21 04:47:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/140 places, 27/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/140 places, 27/178 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s16 0) (NEQ s1 1))], 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 SmartHome-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-07 finished in 286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 131 edges and 140 vertex of which 56 / 140 are part of one of the 6 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Graph (complete) has 154 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 32 rules applied. Total rules applied 34 place count 88 transition count 77
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 41 rules applied. Total rules applied 75 place count 56 transition count 68
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 80 place count 51 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 80 place count 51 transition count 65
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 86 place count 48 transition count 65
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 45 transition count 62
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 45 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 45 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 125 place count 29 transition count 45
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 134 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 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 137 place count 26 transition count 34
Applied a total of 137 rules in 21 ms. Remains 26 /140 variables (removed 114) and now considering 34/178 (removed 144) transitions.
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 26 cols
[2022-05-21 04:47:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 26 cols
[2022-05-21 04:47:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2022-05-21 04:47:38] [INFO ] Redundant transitions in 55 ms returned []
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 26 cols
[2022-05-21 04:47:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:47:38] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/140 places, 34/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/140 places, 34/178 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-10 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:(AND (EQ s0 0) (EQ s13 1) (OR (EQ s9 0) (EQ s9 1) (EQ s3 0) (EQ s3 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 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-11-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-10 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(G(X(p0)))))&&F(p0)))'
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Graph (trivial) has 135 edges and 140 vertex of which 63 / 140 are part of one of the 6 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Graph (complete) has 147 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 81 transition count 74
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 64 place count 53 transition count 68
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 50 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 49 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 69 place count 49 transition count 64
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 75 place count 46 transition count 64
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 80 place count 41 transition count 59
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 41 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 41 transition count 58
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 122 place count 23 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 123 place count 23 transition count 37
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 133 place count 23 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 135 place count 21 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 135 place count 21 transition count 26
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 137 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 138 place count 19 transition count 25
Applied a total of 138 rules in 24 ms. Remains 19 /140 variables (removed 121) and now considering 25/178 (removed 153) transitions.
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:47:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-21 04:47:38] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:47:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:38] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2022-05-21 04:47:39] [INFO ] Redundant transitions in 38 ms returned []
[2022-05-21 04:47:39] [INFO ] Flow matrix only has 20 transitions (discarded 5 similar events)
// Phase 1: matrix 20 rows 19 cols
[2022-05-21 04:47:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:47:39] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/140 places, 25/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/140 places, 25/178 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-11 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 178/178 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 134 transition count 172
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 134 transition count 172
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 130 transition count 168
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 130 transition count 168
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 127 transition count 165
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 127 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 126 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 126 transition count 164
Applied a total of 28 rules in 18 ms. Remains 126 /140 variables (removed 14) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-21 04:47:39] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:39] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-21 04:47:39] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 126 cols
[2022-05-21 04:47:39] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-21 04:47:39] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/140 places, 164/178 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/140 places, 164/178 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-11-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s36 0) (EQ s4 1)), p1:(OR (EQ s121 0) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1101 steps with 6 reset in 18 ms.
FORMULA SmartHome-PT-11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-11-LTLCardinality-14 finished in 597 ms.
All properties solved by simple procedures.
Total runtime 5491 ms.

BK_STOP 1653108459838

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

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