fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271820500131
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for IOTPpurchase-PT-C12M10P15D17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
279.731 6822.00 13343.00 123.70 FFFTFTTTFFTTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820500131.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-C12M10P15D17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 6.8K Apr 29 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 59K 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.5K May 9 08:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 08:07 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-C12M10P15D17-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652746086758

Running Version 202205111006
[2022-05-17 00:08:07] [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:08:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:08:08] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2022-05-17 00:08:08] [INFO ] Transformed 111 places.
[2022-05-17 00:08:08] [INFO ] Transformed 45 transitions.
[2022-05-17 00:08:08] [INFO ] Parsed PT model containing 111 places and 45 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 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:08:08] [INFO ] Computed 36 place invariants in 14 ms
[2022-05-17 00:08:08] [INFO ] Implicit Places using invariants in 162 ms returned [24, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 190 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 2 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 38 out of 78 places after structural reductions.
[2022-05-17 00:08:08] [INFO ] Flatten gal took : 23 ms
[2022-05-17 00:08:08] [INFO ] Flatten gal took : 9 ms
[2022-05-17 00:08:08] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 37 out of 78 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 27) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 78 cols
[2022-05-17 00:08:08] [INFO ] Computed 34 place invariants in 3 ms
[2022-05-17 00:08:08] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-17 00:08:08] [INFO ] [Real]Absence check using 16 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-17 00:08:08] [INFO ] After 50ms 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 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-07 TRUE 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' '!((p0 U G(!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 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 22 place count 58 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 29 place count 52 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 51 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 30 place count 51 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 58 place count 34 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 58 place count 34 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 31 transition count 19
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 78 place count 23 transition count 13
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 80 place count 22 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 21 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 84 place count 19 transition count 11
Applied a total of 84 rules in 17 ms. Remains 19 /78 variables (removed 59) and now considering 11/45 (removed 34) transitions.
// Phase 1: matrix 11 rows 19 cols
[2022-05-17 00:08:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 00:08:09] [INFO ] Implicit Places using invariants in 55 ms returned [1, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/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 17 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 15 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 14 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 14 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 13 transition count 9
Applied a total of 6 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 13 cols
[2022-05-17 00:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:08:09] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 9 rows 13 cols
[2022-05-17 00:08:09] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:08:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/78 places, 9/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 13/78 places, 9/45 transitions.
Stuttering acceptance computed with spot in 240 ms :[p1, true, p1]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s4 s12), p0:(AND (LEQ s4 s12) (LEQ s3 s9))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-00 finished in 429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(!p0 U ((p1 U F(p2)) U X(p3)))))'
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 7 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:08:09] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-17 00:08:09] [INFO ] Implicit Places using invariants in 69 ms returned [5, 10, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 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 3 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 312 ms :[true, (AND p2 p3), p2, p3, p3, p3, p3, p3]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=p3, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=p3, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=p3, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 5}]], initial=3, aps=[p3:(LEQ 2 s54), p2:(LEQ 1 s12), p0:(AND (GT 1 s12) (LEQ s24 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 715 steps with 0 reset in 17 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-02 finished in 436 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(F(p0))&&F(p1)&&F(p2)))'
Support contains 6 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 65 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 59 transition count 37
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 55 transition count 35
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 28 place count 52 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 29 place count 51 transition count 34
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 29 place count 51 transition count 23
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 57 place count 34 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 57 place count 34 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 61 place count 32 transition count 21
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 19 rules applied. Total rules applied 80 place count 20 transition count 14
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 84 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 86 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 86 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 88 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 91 place count 13 transition count 10
Applied a total of 91 rules in 15 ms. Remains 13 /78 variables (removed 65) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 13 cols
[2022-05-17 00:08:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:08:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-17 00:08:10] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:08:10] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-17 00:08:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2022-05-17 00:08:10] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:08:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/78 places, 10/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/78 places, 10/45 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s2 s1), p1:(LEQ s9 s3), p2:(GT s6 s8)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1709 reset in 209 ms.
Stack based approach found an accepted trace after 658 steps with 12 reset with depth 72 and stack size 72 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-04 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&F(p1)))'
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 5 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:08:10] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-17 00:08:10] [INFO ] Implicit Places using invariants in 52 ms returned [10, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/78 places, 45/45 transitions.
Applied a total of 0 rules in 7 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 144 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GT s31 s16), p1:(LEQ s5 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 150 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 p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-05 finished in 657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(X(G(p0)))) U (X(p1)||G(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 6 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:08:11] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-17 00:08:11] [INFO ] Implicit Places using invariants in 62 ms returned [5, 10, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 62 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 435 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p2 p0), acceptance={} source=9 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 7}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(LEQ s13 s25), p1:(LEQ s12 s42), p0:(LEQ 3 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-08 finished in 528 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(p0) U 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 14 rules applied. Total rules applied 23 place count 57 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 30 place count 51 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 50 transition count 33
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 31 place count 50 transition count 20
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 64 place count 30 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 64 place count 30 transition count 17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 70 place count 27 transition count 17
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 91 place count 14 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 93 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 12 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 94 place count 12 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 97 place count 10 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 98 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 100 place count 8 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 100 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 103 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 106 place count 4 transition count 4
Applied a total of 106 rules in 14 ms. Remains 4 /78 variables (removed 74) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 00:08:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 00:08:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 00:08:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-17 00:08:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 00:08:12] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/78 places, 4/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/78 places, 4/45 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 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 s0 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 7160 reset in 66 ms.
Stack based approach found an accepted trace after 33 steps with 2 reset with depth 18 and stack size 18 in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-09 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0) U p1)) U (G(p2)||p1)))'
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 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 30 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 46 transition count 30
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 38 place count 46 transition count 18
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 68 place count 28 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 68 place count 28 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 76 place count 24 transition count 14
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 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 94 place count 13 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 12 transition count 7
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 100 place count 9 transition count 5
Applied a total of 100 rules in 13 ms. Remains 9 /78 variables (removed 69) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 9 cols
[2022-05-17 00:08:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants in 38 ms returned [0, 2, 4]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 39 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/78 places, 5/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 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5 transition count 4
Applied a total of 2 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 00:08:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2022-05-17 00:08:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 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 63 ms :[(NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s2), p2:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 54 ms.
Product exploration explored 100000 steps with 50000 reset in 54 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 p1) (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-10 finished in 462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(F(X(F(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 7 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:08:12] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-17 00:08:12] [INFO ] Implicit Places using invariants in 59 ms returned [5, 10, 18]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 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 2 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 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 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:(LEQ s43 s19)], 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 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 99 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 44 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-11 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U G((G(F(p2))&&G(p1)&&p3))))'
Support contains 7 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 7 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 41
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 60 transition count 36
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 55 transition count 33
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 32 place count 51 transition count 33
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 32 place count 51 transition count 25
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 21 rules applied. Total rules applied 53 place count 38 transition count 25
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 53 place count 38 transition count 22
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 59 place count 35 transition count 22
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 11 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 77 place count 24 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 23 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 23 transition count 14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 22 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 83 place count 20 transition count 13
Applied a total of 83 rules in 9 ms. Remains 20 /78 variables (removed 58) and now considering 13/45 (removed 32) transitions.
// Phase 1: matrix 13 rows 20 cols
[2022-05-17 00:08:13] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants in 32 ms returned [3, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/78 places, 13/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 12 transition count 10
Applied a total of 9 rules in 1 ms. Remains 12 /18 variables (removed 6) and now considering 10/13 (removed 3) transitions.
// Phase 1: matrix 10 rows 12 cols
[2022-05-17 00:08:13] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2022-05-17 00:08:13] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/78 places, 10/45 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/78 places, 10/45 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 p3), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p1 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 2 s8), p3:(GT s6 s2), p0:(LEQ s0 s4), p2:(LEQ s1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-12 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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 3 places :
Implicit places reduction removed 3 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 10 rules applied. Total rules applied 10 place count 66 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 29 place count 55 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 47 transition count 30
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 37 place count 47 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 64 place count 31 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 64 place count 31 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 28 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 3 with 17 rules applied. Total rules applied 87 place count 18 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 89 place count 16 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 16 transition count 7
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 94 place count 13 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 4 with 1 rules applied. Total rules applied 95 place count 13 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 98 place count 11 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 100 place count 9 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 100 place count 9 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 8 transition count 4
Applied a total of 102 rules in 7 ms. Remains 8 /78 variables (removed 70) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 8 cols
[2022-05-17 00:08:13] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants in 25 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/78 places, 4/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 7 transition count 3
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 5 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2 transition count 2
Applied a total of 7 rules in 1 ms. Remains 2 /7 variables (removed 5) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:08:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-17 00:08:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 00:08:13] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 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 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 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:(GT 3 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 2727 reset in 45 ms.
Stack based approach found an accepted trace after 26 steps with 2 reset with depth 15 and stack size 9 in 1 ms.
FORMULA IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C12M10P15D17-LTLCardinality-14 finished in 196 ms.
All properties solved by simple procedures.
Total runtime 5558 ms.

BK_STOP 1652746093580

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

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