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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 7.4K Apr 29 18:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 18:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 18:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 18:15 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.5K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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-C03M03P03D03-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652745839689

Running Version 202205111006
[2022-05-17 00:04:00] [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:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:04:01] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2022-05-17 00:04:01] [INFO ] Transformed 111 places.
[2022-05-17 00:04:01] [INFO ] Transformed 45 transitions.
[2022-05-17 00:04:01] [INFO ] Parsed PT model containing 111 places and 45 transitions in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 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 27 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 80 transition count 45
Applied a total of 31 rules in 13 ms. Remains 80 /111 variables (removed 31) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 80 cols
[2022-05-17 00:04:01] [INFO ] Computed 36 place invariants in 13 ms
[2022-05-17 00:04:01] [INFO ] Implicit Places using invariants in 153 ms returned [12, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 186 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/111 places, 45/45 transitions.
Support contains 46 out of 78 places after structural reductions.
[2022-05-17 00:04:01] [INFO ] Flatten gal took : 23 ms
[2022-05-17 00:04:01] [INFO ] Flatten gal took : 9 ms
[2022-05-17 00:04:01] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 78 cols
[2022-05-17 00:04:01] [INFO ] Computed 34 place invariants in 6 ms
[2022-05-17 00:04:01] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-17 00:04:01] [INFO ] [Real]Absence check using 15 positive and 19 generalized place invariants in 4 ms returned sat
[2022-05-17 00:04:01] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-09 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(X((X(X(p0))||(X(p1)&&p2)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 4 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:04:02] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-17 00:04:02] [INFO ] Implicit Places using invariants in 64 ms returned [13, 17, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 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/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}]], initial=3, aps=[p2:(OR (LEQ 3 s13) (LEQ 1 s16)), p1:(GT s23 s53), p0:(GT 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 236 ms.
Product exploration explored 100000 steps with 25000 reset in 145 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 p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 5 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:03] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:03] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 184 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 3 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Applied a total of 0 rules in 5 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:04:04] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:04:04] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:04] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:04] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:04] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:04] [INFO ] Dead Transitions using invariants and state equation in 40 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 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 147 ms.
Product exploration explored 100000 steps with 25000 reset in 154 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 62 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 9 place count 62 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 21 place count 62 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 61 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 61 transition count 44
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 29 rules in 13 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:04:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2022-05-17 00:04:06] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:06] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 25000 reset in 110 ms.
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Built C files in :
/tmp/ltsmin5522906884479262561
[2022-05-17 00:04:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5522906884479262561
Running compilation step : cd /tmp/ltsmin5522906884479262561;'/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 206 ms.
Running link step : cd /tmp/ltsmin5522906884479262561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5522906884479262561;'/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/stateBased16062027346882419735.hoa' '--buchi-type=spotba'
LTSmin run took 205 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-00 finished in 4905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(X(X(p0))))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 12 place count 65 transition count 37
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 52 transition count 27
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 46 place count 42 transition count 26
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 40 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 39 transition count 25
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 50 place count 39 transition count 19
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 66 place count 29 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 66 place count 29 transition count 18
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 68 place count 28 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 17 rules applied. Total rules applied 85 place count 18 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 86 place count 17 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 86 place count 17 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 88 place count 16 transition count 10
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 6 with 5 rules applied. Total rules applied 93 place count 13 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 11 transition count 7
Applied a total of 96 rules in 10 ms. Remains 11 /78 variables (removed 67) and now considering 7/45 (removed 38) transitions.
// Phase 1: matrix 7 rows 11 cols
[2022-05-17 00:04:07] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 20 ms returned [1, 2, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 21 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/78 places, 7/45 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 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 5 transition count 4
Applied a total of 6 rules in 1 ms. Remains 5 /8 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 00:04:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 00:04:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/78 places, 4/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/78 places, 4/45 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-01 finished in 171 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((G(p0)&&X(p1))))||F(p2))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 39
Reduce places removed 11 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 20 rules applied. Total rules applied 30 place count 54 transition count 30
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 41 place count 45 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 43 place count 43 transition count 28
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 43 place count 43 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 65 place count 29 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 65 place count 29 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 27 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 83 place count 19 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 19 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 18 transition count 11
Applied a total of 85 rules in 6 ms. Remains 18 /78 variables (removed 60) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 18 cols
[2022-05-17 00:04:07] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 23 ms returned [2, 3, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/78 places, 11/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 15 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 10 transition count 9
Applied a total of 7 rules in 2 ms. Remains 10 /15 variables (removed 5) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 00:04:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-17 00:04:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-17 00:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/78 places, 9/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/78 places, 9/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s3), p2:(LEQ s7 s1), p1:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6031 reset in 93 ms.
Stack based approach found an accepted trace after 1504 steps with 91 reset with depth 42 and stack size 40 in 2 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-02 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G((G(p0)&&p1))))&&F(X(p2))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 45
Applied a total of 12 rules in 3 ms. Remains 66 /78 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:07] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:04:07] [INFO ] Implicit Places using invariants in 43 ms returned [17, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/78 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LEQ s13 s16) (LEQ 3 s29)), p0:(LEQ s3 s26), p1:(LEQ s13 s16)], 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 2 reset in 133 ms.
Stack based approach found an accepted trace after 282 steps with 0 reset with depth 283 and stack size 283 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-03 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(!p0) U (G(p1)||F(p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 67 transition count 45
Applied a total of 11 rules in 4 ms. Remains 67 /78 variables (removed 11) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2022-05-17 00:04:08] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants in 44 ms returned [14, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/78 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR p2 p1), (OR p2 p1), true, p1, p2, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ s59 s23), p1:(LEQ 3 s10), p0:(OR (LEQ s12 s17) (LEQ 2 s18) (LEQ 3 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-04 finished in 439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||X((G(p1)||p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 45
Applied a total of 12 rules in 5 ms. Remains 66 /78 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:08] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants in 59 ms returned [17, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 60 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/78 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT s20 s62), p0:(OR (GT s20 s62) (GT s58 s5)), p2:(AND (LEQ s20 s62) (LEQ s24 s36))], 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 214 steps with 0 reset in 3 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-06 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F((G(p0)||F(p1)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 65 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 54 transition count 31
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 38 place count 47 transition count 29
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 44 place count 43 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 46 place count 41 transition count 27
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 46 place count 41 transition count 21
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 62 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 62 place count 31 transition count 20
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 64 place count 30 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 79 place count 21 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 82 place count 19 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 83 place count 18 transition count 13
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 7 with 5 rules applied. Total rules applied 88 place count 15 transition count 11
Applied a total of 88 rules in 18 ms. Remains 15 /78 variables (removed 63) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-17 00:04:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants in 34 ms returned [2, 3, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 35 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/78 places, 11/45 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 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 8
Applied a total of 6 rules in 2 ms. Remains 9 /12 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:04:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-17 00:04:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:04:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/78 places, 8/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/78 places, 8/45 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s6 s4), p1:(LEQ s1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2692 reset in 79 ms.
Stack based approach found an accepted trace after 46453 steps with 1170 reset with depth 69 and stack size 58 in 59 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-07 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((F(p0)&&X(p1))))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 3 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:04:08] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-17 00:04:09] [INFO ] Implicit Places using invariants in 40 ms returned [13, 17, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s50), p1:(LEQ s0 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4949 reset in 111 ms.
Product exploration explored 100000 steps with 4978 reset in 134 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 p0)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Finished random walk after 43 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:10] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-17 00:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 00:04:10] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 00:04:10] [INFO ] Added : 14 causal constraints over 3 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 1 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:04:10] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:10] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:10] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:04:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:10] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-17 00:04:10] [INFO ] Dead Transitions using invariants and state equation in 224 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 (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Finished random walk after 40 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), true, (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:11] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-17 00:04:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:11] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:04:11] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 00:04:11] [INFO ] Added : 14 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 4999 reset in 112 ms.
Product exploration explored 100000 steps with 4992 reset in 117 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 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 7 place count 62 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 21 place count 62 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 61 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 61 transition count 44
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 30 rules in 11 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:04:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2022-05-17 00:04:12] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:12] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 9796 reset in 220 ms.
Product exploration explored 100000 steps with 9777 reset in 178 ms.
Built C files in :
/tmp/ltsmin4533355392901504105
[2022-05-17 00:04:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4533355392901504105
Running compilation step : cd /tmp/ltsmin4533355392901504105;'/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 109 ms.
Running link step : cd /tmp/ltsmin4533355392901504105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin4533355392901504105;'/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/stateBased4178636726695549836.hoa' '--buchi-type=spotba'
LTSmin run took 392 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-08 finished in 4385 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 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 12 rules applied. Total rules applied 12 place count 65 transition count 37
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 25 rules applied. Total rules applied 37 place count 51 transition count 26
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 49 place count 40 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 50 place count 39 transition count 25
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 50 place count 39 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 19 rules applied. Total rules applied 69 place count 27 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 27 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 73 place count 25 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 90 place count 15 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 92 place count 14 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 93 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 11 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 97 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 99 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 99 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 101 place count 8 transition count 5
Applied a total of 101 rules in 5 ms. Remains 8 /78 variables (removed 70) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 8 cols
[2022-05-17 00:04:13] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants in 23 ms returned [2, 3, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/78 places, 5/45 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 0 with 2 rules applied. Total rules applied 2 place count 5 transition count 3
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 2 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:04:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:04:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/78 places, 2/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 2/78 places, 2/45 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-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:(LEQ 2 s0)], 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 16278 reset in 44 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 3 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-10 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(X(X((X(G(p0))&&X(p0)))))))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 2 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:04:13] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants in 35 ms returned [13, 17, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11 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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(LEQ s12 s16)], 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-11 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1||(G(!p1)&&G(p2))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 66 transition count 45
Applied a total of 12 rules in 1 ms. Remains 66 /78 variables (removed 12) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 66 cols
[2022-05-17 00:04:13] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:04:13] [INFO ] Implicit Places using invariants in 44 ms returned [14, 18, 28]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 44 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 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/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s43), p2:(GT s10 s12), p0:(LEQ 3 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Stack based approach found an accepted trace after 275 steps with 0 reset with depth 276 and stack size 276 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-13 finished in 341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 45
Applied a total of 13 rules in 1 ms. Remains 65 /78 variables (removed 13) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2022-05-17 00:04:14] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-17 00:04:14] [INFO ] Implicit Places using invariants in 38 ms returned [13, 17, 27]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/78 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 62/78 places, 45/45 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LEQ 1 s28) (AND (LEQ s14 s17) (LEQ s32 s45)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8544 reset in 98 ms.
Product exploration explored 100000 steps with 8608 reset in 102 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:15] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 00:04:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:04:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:15] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:04:15] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 00:04:15] [INFO ] Added : 12 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
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 1 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:04:15] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-17 00:04:15] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:15] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:15] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:15] [INFO ] Dead Transitions using invariants and state equation in 44 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 : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 45 rows 62 cols
[2022-05-17 00:04:15] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-17 00:04:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 00:04:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 00:04:16] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 00:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 00:04:16] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-17 00:04:16] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 00:04:16] [INFO ] Added : 12 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8598 reset in 97 ms.
Product exploration explored 100000 steps with 8564 reset in 105 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
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 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 62 transition count 45
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 7 place count 62 transition count 45
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 19 place count 62 transition count 45
Performed 6 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 6 rules applied. Total rules applied 25 place count 62 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 61 transition count 44
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 61 transition count 44
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 27 rules in 7 ms. Remains 61 /62 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2022-05-17 00:04:16] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 61 cols
[2022-05-17 00:04:16] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-17 00:04:16] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/62 places, 44/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/62 places, 44/45 transitions.
Product exploration explored 100000 steps with 13661 reset in 185 ms.
Product exploration explored 100000 steps with 13651 reset in 185 ms.
Built C files in :
/tmp/ltsmin14479687681580451680
[2022-05-17 00:04:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14479687681580451680
Running compilation step : cd /tmp/ltsmin14479687681580451680;'/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 121 ms.
Running link step : cd /tmp/ltsmin14479687681580451680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 81 ms.
Running LTSmin : cd /tmp/ltsmin14479687681580451680;'/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/stateBased3821561413560352255.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLCardinality-14 finished in 3178 ms.
All properties solved by simple procedures.
Total runtime 16472 ms.

BK_STOP 1652745857467

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

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