Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856415600123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 15:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 15:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 15:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 15:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679434639755

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 21:37:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:37:21] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-21 21:37:21] [INFO ] Transformed 111 places.
[2023-03-21 21:37:21] [INFO ] Transformed 45 transitions.
[2023-03-21 21:37:21] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 32 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 74 transition count 45
Applied a total of 37 rules in 12 ms. Remains 74 /111 variables (removed 37) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 74 cols
[2023-03-21 21:37:21] [INFO ] Computed 30 place invariants in 11 ms
[2023-03-21 21:37:21] [INFO ] Implicit Places using invariants in 149 ms returned [18, 21, 22, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 70/111 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 70 /70 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 70/111 places, 45/45 transitions.
Support contains 36 out of 70 places after structural reductions.
[2023-03-21 21:37:21] [INFO ] Flatten gal took : 22 ms
[2023-03-21 21:37:21] [INFO ] Flatten gal took : 9 ms
[2023-03-21 21:37:21] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 34 out of 70 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 25) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 45 rows 70 cols
[2023-03-21 21:37:22] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-21 21:37:22] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-21 21:37:22] [INFO ] [Real]Absence check using 15 positive and 11 generalized place invariants in 2 ms returned sat
[2023-03-21 21:37:22] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&(X(p0)||G(p1))))'
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Applied a total of 7 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 21:37:22] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-21 21:37:22] [INFO ] Implicit Places using invariants in 48 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/70 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 LTL mode , in 2 iterations and 54 ms. Remains : 62/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}]], initial=2, aps=[p0:(LEQ s20 s50), p1:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 126 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 finished in 883 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 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 63 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 55 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 49 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 48 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 30 place count 48 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 58 place count 32 transition count 21
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 32 transition count 18
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 29 transition count 18
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 85 place count 16 transition count 10
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 89 place count 13 transition count 8
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 91 place count 12 transition count 8
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 99 place count 7 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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 102 place count 5 transition count 4
Applied a total of 102 rules in 20 ms. Remains 5 /70 variables (removed 65) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-21 21:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 21:37:23] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-21 21:37:23] [INFO ] Invariant cache hit.
[2023-03-21 21:37:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-21 21:37:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:37:23] [INFO ] Invariant cache hit.
[2023-03-21 21:37:23] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/70 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 5/70 places, 4/45 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 s2)], 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 8880 reset in 128 ms.
Stack based approach found an accepted trace after 75 steps with 9 reset with depth 12 and stack size 12 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 45
Applied a total of 6 rules in 5 ms. Remains 64 /70 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2023-03-21 21:37:23] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-21 21:37:24] [INFO ] Implicit Places using invariants in 41 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 63/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 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:(GT 2 s43)], 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 86 ms.
Product exploration explored 100000 steps with 33333 reset in 89 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 66 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 45
Applied a total of 6 rules in 3 ms. Remains 64 /70 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2023-03-21 21:37:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-21 21:37:24] [INFO ] Implicit Places using invariants in 43 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/70 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 63/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 3 s23)], 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 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 finished in 172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0&&X((X(F(p1))||G(p0)))) U (G((p0&&X((X(F(p1))||G(p0)))))||(X((X(F(p1))||G(p0)))&&p2))))))'
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 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 63 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 52 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 44 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 44 transition count 19
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 63 place count 29 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 63 place count 29 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 27 transition count 17
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 3 with 15 rules applied. Total rules applied 82 place count 18 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 18 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 17 transition count 10
Applied a total of 84 rules in 12 ms. Remains 17 /70 variables (removed 53) and now considering 10/45 (removed 35) transitions.
// Phase 1: matrix 10 rows 17 cols
[2023-03-21 21:37:24] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-21 21:37:24] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 21:37:24] [INFO ] Invariant cache hit.
[2023-03-21 21:37:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-21 21:37:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:37:24] [INFO ] Invariant cache hit.
[2023-03-21 21:37:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/70 places, 10/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 17/70 places, 10/45 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(OR p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR p2 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p2 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GT 1 s4) (GT s12 s16)), p0:(GT s12 s16), p1:(LEQ 2 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 7090 reset in 127 ms.
Stack based approach found an accepted trace after 2419 steps with 170 reset with depth 17 and stack size 17 in 4 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 finished in 472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Applied a total of 7 rules in 3 ms. Remains 63 /70 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 21:37:25] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-21 21:37:25] [INFO ] Implicit Places using invariants in 46 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/70 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 LTL mode , in 2 iterations and 53 ms. Remains : 62/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 2 s29) (LEQ 1 s34))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&X((p1 U X((p2||G(p1)))))))))'
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 63 transition count 45
Applied a total of 7 rules in 6 ms. Remains 63 /70 variables (removed 7) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 21:37:25] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-21 21:37:25] [INFO ] Implicit Places using invariants in 43 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/70 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 LTL mode , in 2 iterations and 52 ms. Remains : 62/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 3}]], initial=0, aps=[p0:(LEQ s48 s25), p1:(GT s40 s16), p2:(GT 3 s13)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2453 reset in 146 ms.
Product exploration explored 100000 steps with 2446 reset in 194 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 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 491 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 62 cols
[2023-03-21 21:37:26] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-21 21:37:26] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:37:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 21:37:26] [INFO ] [Nat]Absence check using 16 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-21 21:37:26] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 692 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
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.
[2023-03-21 21:37:27] [INFO ] Invariant cache hit.
[2023-03-21 21:37:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-21 21:37:27] [INFO ] Invariant cache hit.
[2023-03-21 21:37:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-21 21:37:27] [INFO ] Invariant cache hit.
[2023-03-21 21:37:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. 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) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 633 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :4
Finished Best-First random walk after 132 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=132 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 889 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2461 reset in 161 ms.
Product exploration explored 100000 steps with 2454 reset in 146 ms.
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 3 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-21 21:37:30] [INFO ] Invariant cache hit.
[2023-03-21 21:37:30] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-21 21:37:30] [INFO ] Invariant cache hit.
[2023-03-21 21:37:30] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-21 21:37:30] [INFO ] Invariant cache hit.
[2023-03-21 21:37:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 62/62 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 finished in 5895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 45
Applied a total of 6 rules in 2 ms. Remains 64 /70 variables (removed 6) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 64 cols
[2023-03-21 21:37:31] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-21 21:37:31] [INFO ] Implicit Places using invariants in 38 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/70 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 LTL mode , in 2 iterations and 42 ms. Remains : 63/70 places, 45/45 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 3 s54), p0:(LEQ 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9183 reset in 92 ms.
Product exploration explored 100000 steps with 9187 reset in 100 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 p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7965 steps, including 2 resets, run visited all 2 properties in 17 ms. (steps per millisecond=468 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 21:37:32] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-21 21:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-21 21:37:32] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 21:37:32] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-21 21:37:32] [INFO ] Invariant cache hit.
[2023-03-21 21:37:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-21 21:37:32] [INFO ] Invariant cache hit.
[2023-03-21 21:37:32] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-21 21:37:32] [INFO ] Invariant cache hit.
[2023-03-21 21:37:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 63/63 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4467 steps, including 1 resets, run visited all 2 properties in 13 ms. (steps per millisecond=343 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 21:37:32] [INFO ] Invariant cache hit.
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-21 21:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:37:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-21 21:37:32] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-21 21:37:32] [INFO ] Added : 3 causal constraints over 1 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 9120 reset in 100 ms.
Product exploration explored 100000 steps with 9164 reset in 106 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 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 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 7 place count 63 transition count 45
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 22 place count 63 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 13 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2023-03-21 21:37:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2023-03-21 21:37:33] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-21 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 44/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 62/63 places, 44/45 transitions.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 21:37:33] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-21 21:37:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-21 21:37:33] [INFO ] Invariant cache hit.
[2023-03-21 21:37:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-21 21:37:33] [INFO ] Invariant cache hit.
[2023-03-21 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 63/63 places, 45/45 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 finished in 2482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 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 9 rules applied. Total rules applied 9 place count 63 transition count 39
Reduce places removed 9 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 14 rules applied. Total rules applied 23 place count 54 transition count 34
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 29 place count 49 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 48 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 30 place count 48 transition count 20
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 61 place count 30 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 61 place count 30 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 69 place count 26 transition count 16
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 90 place count 13 transition count 8
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 10 transition count 7
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 10 transition count 6
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 8 transition count 6
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 8 transition count 5
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 7 with 3 rules applied. Total rules applied 101 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 103 place count 5 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 104 place count 4 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 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 107 place count 2 transition count 2
Applied a total of 107 rules in 4 ms. Remains 2 /70 variables (removed 68) and now considering 2/45 (removed 43) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-21 21:37:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 21:37:33] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 21:37:33] [INFO ] Invariant cache hit.
[2023-03-21 21:37:33] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2023-03-21 21:37:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:37:33] [INFO ] Invariant cache hit.
[2023-03-21 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/70 places, 2/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 2/70 places, 2/45 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 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 3 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 43 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 5 in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 finished in 258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&X((p1 U X((p2||G(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Found a Shortening insensitive property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 70/70 places, 45/45 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 64 transition count 40
Reduce places removed 7 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 11 rules applied. Total rules applied 18 place count 57 transition count 36
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 53 transition count 36
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 22 place count 53 transition count 22
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 33 rules applied. Total rules applied 55 place count 34 transition count 22
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 55 place count 34 transition count 18
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 63 place count 30 transition count 18
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 85 place count 16 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 88 place count 15 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 13 transition count 7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 93 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 5 with 1 rules applied. Total rules applied 94 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 96 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 96 place count 9 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 7 with 3 rules applied. Total rules applied 99 place count 7 transition count 5
Applied a total of 99 rules in 19 ms. Remains 7 /70 variables (removed 63) and now considering 5/45 (removed 40) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-21 21:37:34] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-21 21:37:34] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 7/70 places, 5/45 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 84 ms. Remains : 7/70 places, 5/45 transitions.
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(LEQ 3 s6), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 48 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 p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 126 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-21 21:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:37:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 21:37:34] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 21:37:34] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-21 21:37:34] [INFO ] Invariant cache hit.
[2023-03-21 21:37:34] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 7/7 places, 5/5 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 135 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-21 21:37:35] [INFO ] Invariant cache hit.
[2023-03-21 21:37:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-21 21:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:37:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 21:37:35] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 21:37:35] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-21 21:37:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:37:35] [INFO ] Invariant cache hit.
[2023-03-21 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28 ms. Remains : 7/7 places, 5/5 transitions.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-21 21:37:35] [INFO ] Invariant cache hit.
[2023-03-21 21:37:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 21:37:35] [INFO ] Invariant cache hit.
[2023-03-21 21:37:35] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-21 21:37:35] [INFO ] Invariant cache hit.
[2023-03-21 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 finished in 2009 ms.
[2023-03-21 21:37:35] [INFO ] Flatten gal took : 4 ms
[2023-03-21 21:37:35] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 21:37:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 45 transitions and 140 arcs took 1 ms.
Total runtime 14782 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT IOTPpurchase-PT-C05M04P03D02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679434659973

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
lola: result : false
lola: markings : 1198789
lola: fired transitions : 4090134
lola: time used : 3.000000
lola: memory pages used : 8
lola: LAUNCH task # 4 (type EXCL) for 3 IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
lola: result : true
lola: markings : 268
lola: fired transitions : 873
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12: LTL false LTL model checker
IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13: LTL true LTL model checker


Time elapsed: 3 secs. Pages in use: 8

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IOTPpurchase-PT-C05M04P03D02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856415600123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;