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.r359-smll-167891808800355.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 SemanticWebServices-PT-S064P12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808800355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 10:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 10:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 10:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 26 10:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 117K Mar 5 18:23 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 SemanticWebServices-PT-S064P12-LTLCardinality-00
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-01
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-02
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-03
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-04
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-05
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-06
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-07
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-08
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-09
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-10
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-11
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-12
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-13
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-14
FORMULA_NAME SemanticWebServices-PT-S064P12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679079504982

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=SemanticWebServices-PT-S064P12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 18:58:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 18:58:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 18:58:27] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-17 18:58:27] [INFO ] Transformed 104 places.
[2023-03-17 18:58:27] [INFO ] Transformed 158 transitions.
[2023-03-17 18:58:27] [INFO ] Parsed PT model containing 104 places and 158 transitions and 863 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 79/79 transitions.
Ensure Unique test removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 77 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 74 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 74 transition count 76
Applied a total of 31 rules in 32 ms. Remains 74 /102 variables (removed 28) and now considering 76/79 (removed 3) transitions.
[2023-03-17 18:58:28] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
// Phase 1: matrix 67 rows 74 cols
[2023-03-17 18:58:28] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-17 18:58:28] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-17 18:58:28] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-17 18:58:28] [INFO ] Invariant cache hit.
[2023-03-17 18:58:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 18:58:28] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2023-03-17 18:58:28] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-17 18:58:28] [INFO ] Invariant cache hit.
[2023-03-17 18:58:29] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/102 places, 76/79 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 74/102 places, 76/79 transitions.
Support contains 46 out of 74 places after structural reductions.
[2023-03-17 18:58:29] [INFO ] Flatten gal took : 54 ms
[2023-03-17 18:58:29] [INFO ] Flatten gal took : 23 ms
[2023-03-17 18:58:29] [INFO ] Input system was already deterministic with 76 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 802 ms. (steps per millisecond=12 ) properties (out of 28) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 18:58:30] [INFO ] Flow matrix only has 67 transitions (discarded 9 similar events)
[2023-03-17 18:58:30] [INFO ] Invariant cache hit.
[2023-03-17 18:58:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-17 18:58:30] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-17 18:58:30] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 241 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 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(p0) U p1))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 58 transition count 69
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 58 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 58 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 54 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 54 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 50 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 50 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 42 place count 48 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 48 transition count 58
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 46 transition count 56
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 46 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 46 transition count 54
Applied a total of 50 rules in 29 ms. Remains 46 /74 variables (removed 28) and now considering 54/76 (removed 22) transitions.
[2023-03-17 18:58:31] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
// Phase 1: matrix 47 rows 46 cols
[2023-03-17 18:58:31] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-17 18:58:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-17 18:58:31] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2023-03-17 18:58:31] [INFO ] Invariant cache hit.
[2023-03-17 18:58:31] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-17 18:58:31] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-17 18:58:31] [INFO ] Flow matrix only has 47 transitions (discarded 7 similar events)
[2023-03-17 18:58:31] [INFO ] Invariant cache hit.
[2023-03-17 18:58:31] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/74 places, 54/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 46/74 places, 54/76 transitions.
Stuttering acceptance computed with spot in 389 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT s36 s11), p0:(LEQ s28 s14)], 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 1 reset in 509 ms.
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-01 finished in 1321 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)&&F(G(p1)))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 52 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 52 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 52 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 48 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 48 transition count 61
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 44 transition count 57
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 44 transition count 57
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 41 transition count 54
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 41 transition count 54
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 38 transition count 51
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 38 transition count 51
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 38 transition count 48
Applied a total of 45 rules in 45 ms. Remains 38 /74 variables (removed 36) and now considering 48/76 (removed 28) transitions.
[2023-03-17 18:58:32] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
// Phase 1: matrix 41 rows 38 cols
[2023-03-17 18:58:32] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 18:58:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 18:58:32] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2023-03-17 18:58:32] [INFO ] Invariant cache hit.
[2023-03-17 18:58:32] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-17 18:58:32] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-17 18:58:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 18:58:32] [INFO ] Flow matrix only has 41 transitions (discarded 7 similar events)
[2023-03-17 18:58:32] [INFO ] Invariant cache hit.
[2023-03-17 18:58:32] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/74 places, 48/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 38/74 places, 48/76 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s25), p1:(OR (GT s2 s27) (GT s14 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 550 ms.
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-02 finished in 1042 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)&&F(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 49 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 49 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 49 transition count 62
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 43 transition count 56
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 43 transition count 56
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 36 transition count 49
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 36 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 33 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 33 transition count 46
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 30 transition count 43
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 30 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 30 transition count 40
Applied a total of 61 rules in 23 ms. Remains 30 /74 variables (removed 44) and now considering 40/76 (removed 36) transitions.
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
// Phase 1: matrix 33 rows 30 cols
[2023-03-17 18:58:33] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 18:58:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2023-03-17 18:58:33] [INFO ] Invariant cache hit.
[2023-03-17 18:58:33] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 18:58:33] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-17 18:58:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 33 transitions (discarded 7 similar events)
[2023-03-17 18:58:33] [INFO ] Invariant cache hit.
[2023-03-17 18:58:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/74 places, 40/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 30/74 places, 40/76 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s1 s13), p1:(OR (GT s1 s13) (GT 1 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 1 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-03 finished in 424 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(G(p0))||G(p1)))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 57 transition count 68
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 57 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 53 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 53 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 49 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 49 transition count 59
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 46 transition count 56
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 46 transition count 56
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 43 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 43 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 43 transition count 50
Applied a total of 57 rules in 22 ms. Remains 43 /74 variables (removed 31) and now considering 50/76 (removed 26) transitions.
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2023-03-17 18:58:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 18:58:33] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:33] [INFO ] Invariant cache hit.
[2023-03-17 18:58:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-17 18:58:33] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-17 18:58:33] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:33] [INFO ] Invariant cache hit.
[2023-03-17 18:58:33] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/74 places, 50/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 43/74 places, 50/76 transitions.
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 2 s37), p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 89 edges and 43 vertex of which 37 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 231 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-17 18:58:35] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:35] [INFO ] Invariant cache hit.
[2023-03-17 18:58:36] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-17 18:58:36] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:36] [INFO ] Invariant cache hit.
[2023-03-17 18:58:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-17 18:58:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-17 18:58:36] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:36] [INFO ] Invariant cache hit.
[2023-03-17 18:58:36] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 43/43 places, 50/50 transitions.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 89 edges and 43 vertex of which 37 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Finished Best-First random walk after 2910 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=415 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 455 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 50/50 transitions.
Graph (complete) has 89 edges and 43 vertex of which 37 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 36 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 36 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 4 place count 35 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 35 transition count 45
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 33 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 32 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 32 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 31 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 31 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 31 transition count 40
Applied a total of 14 rules in 23 ms. Remains 31 /43 variables (removed 12) and now considering 40/50 (removed 10) transitions.
[2023-03-17 18:58:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 34 transitions (discarded 6 similar events)
// Phase 1: matrix 34 rows 31 cols
[2023-03-17 18:58:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/43 places, 40/50 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 31/43 places, 40/50 transitions.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
// Phase 1: matrix 44 rows 43 cols
[2023-03-17 18:58:39] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 18:58:39] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:39] [INFO ] Invariant cache hit.
[2023-03-17 18:58:39] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-17 18:58:39] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 44 transitions (discarded 6 similar events)
[2023-03-17 18:58:39] [INFO ] Invariant cache hit.
[2023-03-17 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 43/43 places, 50/50 transitions.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-04 finished in 5736 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((p0 U p1)) U p2) U p1))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 67 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 51 transition count 64
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 51 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 51 transition count 63
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 44 transition count 56
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 44 transition count 56
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 37 transition count 49
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 37 transition count 49
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 33 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 30 transition count 42
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 30 transition count 42
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 30 transition count 39
Applied a total of 63 rules in 22 ms. Remains 30 /74 variables (removed 44) and now considering 39/76 (removed 37) transitions.
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
// Phase 1: matrix 32 rows 30 cols
[2023-03-17 18:58:39] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-17 18:58:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:39] [INFO ] Invariant cache hit.
[2023-03-17 18:58:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 18:58:39] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-17 18:58:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:39] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:39] [INFO ] Invariant cache hit.
[2023-03-17 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/74 places, 39/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 30/74 places, 39/76 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s7), p2:(OR (LEQ 1 s8) (LEQ 3 s10)), p0:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6 reset in 248 ms.
Product exploration explored 100000 steps with 0 reset in 242 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Graph (complete) has 93 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (AND (NOT p1) (NOT p2) p0)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))))]
Knowledge based reduction with 12 factoid took 1178 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-17 18:58:42] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:42] [INFO ] Invariant cache hit.
[2023-03-17 18:58:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 18:58:42] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (AND (NOT p1) (NOT p2) p0)), (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0))), true, (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (OR p0 p1)), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (OR (AND p1 (NOT p2)) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0))))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (F (NOT (OR (AND p2 (NOT p1)) (AND p0 (NOT p1))))), (F (NOT (AND (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1469 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
[2023-03-17 18:58:44] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:44] [INFO ] Invariant cache hit.
[2023-03-17 18:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:58:44] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-17 18:58:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:58:44] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-17 18:58:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 18:58:44] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2023-03-17 18:58:44] [INFO ] Computed and/alt/rep : 27/34/20 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 18:58:44] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 39/39 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2023-03-17 18:58:44] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:44] [INFO ] Invariant cache hit.
[2023-03-17 18:58:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 18:58:44] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:44] [INFO ] Invariant cache hit.
[2023-03-17 18:58:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 18:58:44] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-17 18:58:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:44] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:44] [INFO ] Invariant cache hit.
[2023-03-17 18:58:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 30/30 places, 39/39 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Graph (complete) has 93 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 529 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
Finished random walk after 12 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), true]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p1), (F p2), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 658 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
[2023-03-17 18:58:46] [INFO ] Flow matrix only has 32 transitions (discarded 7 similar events)
[2023-03-17 18:58:46] [INFO ] Invariant cache hit.
[2023-03-17 18:58:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 18:58:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-17 18:58:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 18:58:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 18:58:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-17 18:58:47] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 18:58:47] [INFO ] [Nat]Added 19 Read/Feed constraints in 7 ms returned sat
[2023-03-17 18:58:47] [INFO ] Computed and/alt/rep : 27/34/20 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-17 18:58:47] [INFO ] Added : 0 causal constraints over 0 iterations in 19 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-06 finished in 7845 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 U (p1||G(p0))))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 49 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 49 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 44 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 44 transition count 57
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 38 transition count 51
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 33 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 28 transition count 41
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 28 transition count 41
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 28 transition count 36
Applied a total of 67 rules in 26 ms. Remains 28 /74 variables (removed 46) and now considering 36/76 (removed 40) transitions.
[2023-03-17 18:58:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2023-03-17 18:58:47] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 18:58:47] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-17 18:58:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:58:47] [INFO ] Invariant cache hit.
[2023-03-17 18:58:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 18:58:47] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-17 18:58:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:58:47] [INFO ] Invariant cache hit.
[2023-03-17 18:58:47] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/74 places, 36/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 28/74 places, 36/76 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s23 s21), p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Product exploration explored 100000 steps with 0 reset in 729 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 339 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 18:58:49] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:58:49] [INFO ] Invariant cache hit.
[2023-03-17 18:58:49] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:58:49] [INFO ] After 54ms 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-07 finished in 2406 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((p0||G(p1)||F(p2)))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 58 transition count 69
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 58 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 58 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 54 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 54 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 51 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 51 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 50 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 50 transition count 60
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 49 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 49 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 49 transition count 58
Applied a total of 43 rules in 11 ms. Remains 49 /74 variables (removed 25) and now considering 58/76 (removed 18) transitions.
[2023-03-17 18:58:49] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
// Phase 1: matrix 50 rows 49 cols
[2023-03-17 18:58:49] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-17 18:58:49] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-17 18:58:49] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2023-03-17 18:58:49] [INFO ] Invariant cache hit.
[2023-03-17 18:58:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-17 18:58:49] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-17 18:58:49] [INFO ] Flow matrix only has 50 transitions (discarded 8 similar events)
[2023-03-17 18:58:49] [INFO ] Invariant cache hit.
[2023-03-17 18:58:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 58/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 228 ms. Remains : 49/74 places, 58/76 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(LEQ s43 s9), p1:(AND (GT 2 s46) (GT 1 s12)), p0:(LEQ 2 s46)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 103 edges and 49 vertex of which 43 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1 (NOT p2)))))
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-08 finished in 1085 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)||G(p1))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 72 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 64 transition count 74
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 74
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 11 place count 55 transition count 66
Iterating global reduction 0 with 8 rules applied. Total rules applied 19 place count 55 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 55 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 51 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 51 transition count 61
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 31 place count 48 transition count 58
Iterating global reduction 1 with 3 rules applied. Total rules applied 34 place count 48 transition count 58
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 47 transition count 57
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 47 transition count 57
Applied a total of 36 rules in 22 ms. Remains 47 /74 variables (removed 27) and now considering 57/76 (removed 19) transitions.
[2023-03-17 18:58:50] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
// Phase 1: matrix 48 rows 47 cols
[2023-03-17 18:58:50] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 18:58:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-17 18:58:50] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:50] [INFO ] Invariant cache hit.
[2023-03-17 18:58:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-17 18:58:50] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-17 18:58:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:51] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:51] [INFO ] Invariant cache hit.
[2023-03-17 18:58:51] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/74 places, 57/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 47/74 places, 57/76 transitions.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s23 s10) (GT s35 s26) (GT s23 s10)), p1:(GT 2 s2)], nbAcceptance=2, 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 306 ms.
Product exploration explored 100000 steps with 0 reset in 723 ms.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 102 edges and 47 vertex of which 42 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 555 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 18:58:53] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:53] [INFO ] Invariant cache hit.
[2023-03-17 18:58:53] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 18:58:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 18:58:53] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 18:58:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-17 18:58:53] [INFO ] After 14ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 18:58:53] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-17 18:58:53] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 57/57 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 45 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 45 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 54
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 53
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 53
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 52
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 41 transition count 50
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 41 transition count 46
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 22 place count 37 transition count 45
Applied a total of 22 rules in 32 ms. Remains 37 /47 variables (removed 10) and now considering 45/57 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 37/47 places, 45/57 transitions.
Finished random walk after 306 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=153 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 708 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 57/57 transitions.
Applied a total of 0 rules in 4 ms. Remains 47 /47 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2023-03-17 18:58:54] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:54] [INFO ] Invariant cache hit.
[2023-03-17 18:58:54] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-17 18:58:54] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:54] [INFO ] Invariant cache hit.
[2023-03-17 18:58:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-17 18:58:54] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-17 18:58:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:54] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:54] [INFO ] Invariant cache hit.
[2023-03-17 18:58:54] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 47/47 places, 57/57 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Graph (complete) has 102 edges and 47 vertex of which 42 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 494 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 3524 steps, including 1 resets, run visited all 4 properties in 89 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 592 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 188 ms.
Product exploration explored 100000 steps with 0 reset in 428 ms.
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 57/57 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-17 18:58:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-17 18:58:56] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 48 transitions (discarded 9 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 47/47 places, 57/57 transitions.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-10 finished in 5830 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' '!((p0||X(p1)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 58 transition count 69
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 58 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 58 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 54 transition count 64
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 54 transition count 64
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 50 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 47 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 47 transition count 57
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 44 transition count 54
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 44 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 44 transition count 51
Applied a total of 55 rules in 3 ms. Remains 44 /74 variables (removed 30) and now considering 51/76 (removed 25) transitions.
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
// Phase 1: matrix 45 rows 44 cols
[2023-03-17 18:58:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 18:58:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-17 18:58:56] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 45 transitions (discarded 6 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:56] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 44/74 places, 51/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 44/74 places, 51/76 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=1, aps=[p0:(LEQ 2 s39), p1:(LEQ 2 s34)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-11 finished in 286 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) U p1)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 17 place count 57 transition count 68
Iterating global reduction 1 with 8 rules applied. Total rules applied 25 place count 57 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 57 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 54 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 54 transition count 64
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 51 transition count 61
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 51 transition count 61
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 49 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 49 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 48 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 48 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 48 transition count 57
Applied a total of 45 rules in 9 ms. Remains 48 /74 variables (removed 26) and now considering 57/76 (removed 19) transitions.
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 48 cols
[2023-03-17 18:58:56] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 18:58:56] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 18:58:56] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2023-03-17 18:58:56] [INFO ] Invariant cache hit.
[2023-03-17 18:58:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-17 18:58:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-17 18:58:57] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2023-03-17 18:58:57] [INFO ] Invariant cache hit.
[2023-03-17 18:58:57] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/74 places, 57/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 48/74 places, 57/76 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s21 s37), p0:(LEQ 2 s10)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 376 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Graph (complete) has 101 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-13 finished in 1219 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||X(F(p1))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Ensure Unique test removed 7 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 65 transition count 76
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 16 place count 58 transition count 69
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 58 transition count 69
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 54 transition count 65
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 54 transition count 65
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 50 transition count 61
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 50 transition count 61
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 48 transition count 59
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 48 transition count 59
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 47 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 47 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 47 transition count 57
Applied a total of 46 rules in 5 ms. Remains 47 /74 variables (removed 27) and now considering 57/76 (removed 19) transitions.
[2023-03-17 18:58:58] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 47 cols
[2023-03-17 18:58:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 18:58:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-17 18:58:58] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2023-03-17 18:58:58] [INFO ] Invariant cache hit.
[2023-03-17 18:58:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-17 18:58:58] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-17 18:58:58] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
[2023-03-17 18:58:58] [INFO ] Invariant cache hit.
[2023-03-17 18:58:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/74 places, 57/76 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 47/74 places, 57/76 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s9 s0), p1:(GT s19 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 246 ms.
Stuttering criterion allowed to conclude after 140 steps with 3 reset in 1 ms.
FORMULA SemanticWebServices-PT-S064P12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-14 finished in 670 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(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : SemanticWebServices-PT-S064P12-LTLCardinality-04
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 74/74 places, 76/76 transitions.
Graph (complete) has 241 edges and 74 vertex of which 66 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 7 places
Reduce places removed 8 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 49 transition count 63
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 49 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 49 transition count 62
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 44 transition count 57
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 44 transition count 57
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 38 transition count 51
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 38 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 33 transition count 46
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 33 transition count 46
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 28 transition count 41
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 28 transition count 41
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 67 place count 28 transition count 36
Applied a total of 67 rules in 15 ms. Remains 28 /74 variables (removed 46) and now considering 36/76 (removed 40) transitions.
[2023-03-17 18:58:59] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 28 cols
[2023-03-17 18:58:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 18:58:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-17 18:58:59] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:58:59] [INFO ] Invariant cache hit.
[2023-03-17 18:58:59] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 18:58:59] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-17 18:58:59] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:58:59] [INFO ] Invariant cache hit.
[2023-03-17 18:58:59] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 28/74 places, 36/76 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 163 ms. Remains : 28/74 places, 36/76 transitions.
Running random walk in product with property : SemanticWebServices-PT-S064P12-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GT 2 s23), p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 116 ms.
Product exploration explored 100000 steps with 1 reset in 411 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6675 steps, including 2 resets, run visited all 2 properties in 18 ms. (steps per millisecond=370 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-17 18:59:00] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:00] [INFO ] Invariant cache hit.
[2023-03-17 18:59:01] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-17 18:59:01] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:01] [INFO ] Invariant cache hit.
[2023-03-17 18:59:01] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 18:59:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-17 18:59:01] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:01] [INFO ] Invariant cache hit.
[2023-03-17 18:59:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 28/28 places, 36/36 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Finished Best-First random walk after 3574 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=893 )
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-17 18:59:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 18:59:03] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:03] [INFO ] Invariant cache hit.
[2023-03-17 18:59:03] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 28/28 places, 36/36 transitions.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 36/36 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-17 18:59:03] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:03] [INFO ] Invariant cache hit.
[2023-03-17 18:59:03] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 18:59:03] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:03] [INFO ] Invariant cache hit.
[2023-03-17 18:59:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-17 18:59:03] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-17 18:59:03] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2023-03-17 18:59:03] [INFO ] Invariant cache hit.
[2023-03-17 18:59:03] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 28/28 places, 36/36 transitions.
Treatment of property SemanticWebServices-PT-S064P12-LTLCardinality-04 finished in 4632 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)||G(p1))))'
[2023-03-17 18:59:03] [INFO ] Flatten gal took : 14 ms
[2023-03-17 18:59:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-17 18:59:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 76 transitions and 316 arcs took 2 ms.
Total runtime 35871 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SemanticWebServices-PT-S064P12
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1679079565220

--------------------
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: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SemanticWebServices-PT-S064P12-LTLCardinality-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P12-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
SemanticWebServices-PT-S064P12-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 23/32 SemanticWebServices-PT-S064P12-LTLCardinality-04 3014655 m, 602931 m/sec, 3014656 t fired, .

Time elapsed: 5 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for SemanticWebServices-PT-S064P12-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P12-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
SemanticWebServices-PT-S064P12-LTLCardinality-10: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 SemanticWebServices-PT-S064P12-LTLCardinality-10
lola: time limit : 3590 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P12-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
SemanticWebServices-PT-S064P12-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3590 25/32 SemanticWebServices-PT-S064P12-LTLCardinality-10 3227639 m, 645527 m/sec, 3227640 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for SemanticWebServices-PT-S064P12-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
SemanticWebServices-PT-S064P12-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
SemanticWebServices-PT-S064P12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SemanticWebServices-PT-S064P12-LTLCardinality-04: LTL unknown AGGR
SemanticWebServices-PT-S064P12-LTLCardinality-10: LTL unknown AGGR


Time elapsed: 20 secs. Pages in use: 32

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="SemanticWebServices-PT-S064P12"
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 SemanticWebServices-PT-S064P12, 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 r359-smll-167891808800355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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