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.r132-tall-165271820400123.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 IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820400123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 8.8K Apr 29 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 29 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:16 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 4.6K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 13 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652745891703

Running Version 202205111006
[2022-05-17 00:04:52] [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-17 00:04:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:04:53] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2022-05-17 00:04:53] [INFO ] Transformed 111 places.
[2022-05-17 00:04:53] [INFO ] Transformed 45 transitions.
[2022-05-17 00:04:53] [INFO ] Parsed PT model containing 111 places and 45 transitions in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 32 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 73 transition count 45
Applied a total of 38 rules in 12 ms. Remains 73 /111 variables (removed 38) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 73 cols
[2022-05-17 00:04:53] [INFO ] Computed 29 place invariants in 6 ms
[2022-05-17 00:04:53] [INFO ] Implicit Places using invariants in 151 ms returned [11, 18, 21, 29]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 178 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/111 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/111 places, 45/45 transitions.
Support contains 36 out of 69 places after structural reductions.
[2022-05-17 00:04:53] [INFO ] Flatten gal took : 22 ms
[2022-05-17 00:04:53] [INFO ] Flatten gal took : 8 ms
[2022-05-17 00:04:53] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 34 out of 69 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 45 rows 69 cols
[2022-05-17 00:04:54] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-17 00:04:54] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:54] [INFO ] [Real]Absence check using 15 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:54] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-17 00:04:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:54] [INFO ] [Nat]Absence check using 15 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-17 00:04:54] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(F(p1))))))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 63 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 22 rules applied. Total rules applied 32 place count 50 transition count 28
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 41 place count 41 transition count 28
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 41 place count 41 transition count 19
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 62 place count 29 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 62 place count 29 transition count 17
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 27 transition count 17
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 79 place count 19 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 18 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 80 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 17 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 87 place count 14 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 12 transition count 8
Applied a total of 90 rules in 14 ms. Remains 12 /69 variables (removed 57) and now considering 8/45 (removed 37) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-17 00:04:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-17 00:04:54] [INFO ] Implicit Places using invariants in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/69 places, 8/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/69 places, 8/45 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s6), p1:(OR (LEQ 1 s7) (LEQ s5 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8141 reset in 260 ms.
Product exploration explored 100000 steps with 8185 reset in 114 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 52 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-17 00:04:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:04:55] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2022-05-17 00:04:55] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:04:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-17 00:04:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 11 cols
[2022-05-17 00:04:55] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:04:55] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8195 reset in 93 ms.
Product exploration explored 100000 steps with 8235 reset in 130 ms.
Built C files in :
/tmp/ltsmin1445646790918743338
[2022-05-17 00:04:56] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-17 00:04:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:56] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-17 00:04:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:56] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-17 00:04:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 00:04:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1445646790918743338
Running compilation step : cd /tmp/ltsmin1445646790918743338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin1445646790918743338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin1445646790918743338;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16309656424732511481.hoa' '--buchi-type=spotba'
LTSmin run took 67 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 finished in 2458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 45
Applied a total of 6 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:04:57] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:04:57] [INFO ] Implicit Places using invariants in 59 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (GT 2 s13) (GT s27 s50))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 993 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 finished in 196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 45
Applied a total of 6 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:04:57] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:04:57] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s38)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 finished in 147 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(G(p0)))||F((G(p0)||p1))))))'
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 45
Applied a total of 6 rules in 7 ms. Remains 63 /69 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:04:57] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:04:57] [INFO ] Implicit Places using invariants in 45 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(GT s0 s52), p1:(GT 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1)
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 finished in 531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0 U p1)&&p2))||(p3 U G(p2))))'
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 64 transition count 45
Applied a total of 5 rules in 5 ms. Remains 64 /69 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:04:57] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:04:58] [INFO ] Implicit Places using invariants in 48 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 425 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p2) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(OR (AND (NOT p2) p3) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=2 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=2 dest: 9}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=9 dest: 5}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=9 dest: 8}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ 1 s7), p3:(LEQ s8 s5), p1:(OR (LEQ s17 s6) (LEQ 2 s49)), p0:(LEQ 2 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 139 steps with 0 reset in 2 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 finished in 506 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0 U (X((F(p0) U p0))||(F(G(p1))&&p2))))))'
Support contains 5 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 63 transition count 45
Applied a total of 6 rules in 8 ms. Remains 63 /69 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:04:58] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:04:58] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/69 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s27 s31), p0:(LEQ s61 s55), p1:(LEQ 1 s42)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25022 reset in 100 ms.
Product exploration explored 100000 steps with 24977 reset in 109 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 340 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 428 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p0)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 450 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:05:00] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:05:00] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:05:00] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:05:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:05:00] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:05:00] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 383 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 485 steps, including 0 resets, run visited all 5 properties in 14 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25040 reset in 97 ms.
Product exploration explored 100000 steps with 24993 reset in 102 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 45
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 8 place count 62 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 22 place count 62 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 62 transition count 45
Deduced a syphon composed of 25 places in 1 ms
Applied a total of 25 rules in 14 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2022-05-17 00:05:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:05:02] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:05:02] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/62 places, 45/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/62 places, 45/45 transitions.
Product exploration explored 100000 steps with 24816 reset in 221 ms.
Product exploration explored 100000 steps with 25048 reset in 221 ms.
Built C files in :
/tmp/ltsmin5125628594079165594
[2022-05-17 00:05:02] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5125628594079165594
Running compilation step : cd /tmp/ltsmin5125628594079165594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin5125628594079165594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5125628594079165594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2451055670703983402.hoa' '--buchi-type=spotba'
LTSmin run took 125 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 finished in 4684 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)&&X(p1)))&&p1) U !(F(p0)&&p2)))'
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 64 transition count 45
Applied a total of 5 rules in 2 ms. Remains 64 /69 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:05:03] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 00:05:03] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND p0 p2), true, p0, (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1)), (OR (NOT p1) (NOT p0)), (AND p0 (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 2}]], initial=0, aps=[p2:(GT s32 s43), p0:(LEQ 1 s26), p1:(LEQ 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24963 reset in 123 ms.
Entered a terminal (fully accepting) state of product in 4768 steps with 1196 reset in 6 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 finished in 454 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!((!(p0 U p1)&&F(p2)) U p3) U G(p1))))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 64 transition count 45
Applied a total of 5 rules in 4 ms. Remains 64 /69 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2022-05-17 00:05:03] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 00:05:03] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/69 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 63/69 places, 45/45 transitions.
Stuttering acceptance computed with spot in 305 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p3 p1), acceptance={} source=5 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(LEQ 2 s41), p1:(LEQ s61 s49), p2:(LEQ s20 s16), p0:(LEQ s44 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 808 reset in 116 ms.
Product exploration explored 100000 steps with 793 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 707 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 297 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Finished random walk after 3158 steps, including 0 resets, run visited all 8 properties in 17 ms. (steps per millisecond=185 )
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p1) p0)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p3 p1))]
Knowledge based reduction with 14 factoid took 869 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 275 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 279 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:05:06] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-17 00:05:06] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:05:06] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 00:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 00:05:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:05:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:05:06] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-17 00:05:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:05:06] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 00:05:06] [INFO ] Added : 37 causal constraints over 8 iterations in 52 ms. Result :sat
Could not prove EG p1
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:05:06] [INFO ] Computed 19 place invariants in 0 ms
[2022-05-17 00:05:06] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:05:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:05:06] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:05:06] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:05:07] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 620 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 289 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Finished random walk after 158 steps, including 0 resets, run visited all 8 properties in 9 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p3) p1 p2 p0), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p3) p1)), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p3) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p1) p0)), (F (AND (NOT p3) (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p3) (NOT p2))), (F (NOT (AND (NOT p3) p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND p3 p1))]
Knowledge based reduction with 14 factoid took 761 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 276 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 269 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
// Phase 1: matrix 45 rows 63 cols
[2022-05-17 00:05:09] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 00:05:09] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:05:09] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:05:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:09] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 00:05:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:05:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:05:09] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 00:05:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:05:09] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:05:09] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:05:09] [INFO ] Added : 37 causal constraints over 8 iterations in 44 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 321 ms :[p1, p1, p1, (AND p1 (NOT p2)), (AND p1 (NOT p3)), (AND p1 p3), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 788 reset in 121 ms.
Stack based approach found an accepted trace after 62973 steps with 507 reset with depth 136 and stack size 136 in 79 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 finished in 6389 ms.
All properties solved by simple procedures.
Total runtime 17154 ms.

BK_STOP 1652745910096

--------------------
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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r132-tall-165271820400123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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