Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692600467.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 63K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678501116680

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=BusinessProcesses-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:18:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:18:38] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-11 02:18:38] [INFO ] Transformed 274 places.
[2023-03-11 02:18:38] [INFO ] Transformed 237 transitions.
[2023-03-11 02:18:38] [INFO ] Found NUPN structural information;
[2023-03-11 02:18:38] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 40 place count 233 transition count 198
Iterating global reduction 1 with 38 rules applied. Total rules applied 78 place count 233 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 233 transition count 197
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 99 place count 213 transition count 177
Iterating global reduction 2 with 20 rules applied. Total rules applied 119 place count 213 transition count 177
Applied a total of 119 rules in 40 ms. Remains 213 /273 variables (removed 60) and now considering 177/236 (removed 59) transitions.
// Phase 1: matrix 177 rows 213 cols
[2023-03-11 02:18:38] [INFO ] Computed 41 place invariants in 8 ms
[2023-03-11 02:18:38] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-11 02:18:38] [INFO ] Invariant cache hit.
[2023-03-11 02:18:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-11 02:18:38] [INFO ] Invariant cache hit.
[2023-03-11 02:18:38] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/273 places, 177/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 503 ms. Remains : 213/273 places, 177/236 transitions.
Support contains 31 out of 213 places after structural reductions.
[2023-03-11 02:18:39] [INFO ] Flatten gal took : 30 ms
[2023-03-11 02:18:39] [INFO ] Flatten gal took : 11 ms
[2023-03-11 02:18:39] [INFO ] Input system was already deterministic with 177 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 02:18:39] [INFO ] Invariant cache hit.
[2023-03-11 02:18:39] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:18:39] [INFO ] [Nat]Absence check using 41 positive place invariants in 8 ms returned sat
[2023-03-11 02:18:40] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 4 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 39 places in 30 ms of which 1 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 190 ms
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-11 02:18:40] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2023-03-11 02:18:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-11 02:18:40] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 02:18:40] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 13 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 96 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 430 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 207 transition count 145
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 184 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 183 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 50 place count 183 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 128 place count 140 transition count 109
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 137 transition count 106
Ensure Unique test removed 1 places
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 136 transition count 106
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 247 place count 80 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 248 place count 79 transition count 49
Applied a total of 248 rules in 31 ms. Remains 79 /213 variables (removed 134) and now considering 49/177 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 79/213 places, 49/177 transitions.
Incomplete random walk after 10000 steps, including 323 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :5
Finished Best-First random walk after 471 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=235 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 207 stabilizing places and 169 stable transitions
Graph (complete) has 442 edges and 213 vertex of which 212 are kept as prefixes of interest. Removing 1 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(X(G(p0))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 206 transition count 170
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 206 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 205 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 205 transition count 169
Applied a total of 16 rules in 12 ms. Remains 205 /213 variables (removed 8) and now considering 169/177 (removed 8) transitions.
// Phase 1: matrix 169 rows 205 cols
[2023-03-11 02:18:40] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:18:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 02:18:40] [INFO ] Invariant cache hit.
[2023-03-11 02:18:40] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 02:18:40] [INFO ] Invariant cache hit.
[2023-03-11 02:18:40] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/213 places, 169/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 205/213 places, 169/177 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s87 0) (EQ s194 1)) (AND (EQ s147 0) (EQ s178 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-00 finished in 512 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(X(X((G(F(p0))||G(p1)))))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 204 transition count 168
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 204 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 202 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 202 transition count 166
Applied a total of 22 rules in 10 ms. Remains 202 /213 variables (removed 11) and now considering 166/177 (removed 11) transitions.
// Phase 1: matrix 166 rows 202 cols
[2023-03-11 02:18:41] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 02:18:41] [INFO ] Invariant cache hit.
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-11 02:18:41] [INFO ] Invariant cache hit.
[2023-03-11 02:18:41] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/213 places, 166/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 202/213 places, 166/177 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s72 0), p0:(AND (EQ s85 0) (EQ s194 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-01 finished in 511 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(p0)&&(p1 U p2)))'
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 105 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 206 transition count 142
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 179 transition count 142
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 56 place count 179 transition count 104
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 142 place count 131 transition count 104
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 147 place count 126 transition count 99
Ensure Unique test removed 1 places
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 125 transition count 99
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 264 place count 69 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 68 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 67 transition count 43
Applied a total of 266 rules in 26 ms. Remains 67 /213 variables (removed 146) and now considering 43/177 (removed 134) transitions.
// Phase 1: matrix 43 rows 67 cols
[2023-03-11 02:18:41] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 02:18:41] [INFO ] Invariant cache hit.
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 48]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 92 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/213 places, 43/177 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 53 transition count 42
Applied a total of 2 rules in 3 ms. Remains 53 /54 variables (removed 1) and now considering 42/43 (removed 1) transitions.
// Phase 1: matrix 42 rows 53 cols
[2023-03-11 02:18:41] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 02:18:41] [INFO ] Invariant cache hit.
[2023-03-11 02:18:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/213 places, 42/177 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 53/213 places, 42/177 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p2), (NOT p0), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p2:(OR (EQ s29 0) (EQ s24 1)), p1:(EQ s40 1), p0:(AND (EQ s35 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-05 finished in 309 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)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 204 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 204 transition count 168
Applied a total of 18 rules in 7 ms. Remains 204 /213 variables (removed 9) and now considering 168/177 (removed 9) transitions.
// Phase 1: matrix 168 rows 204 cols
[2023-03-11 02:18:42] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-11 02:18:42] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 02:18:42] [INFO ] Invariant cache hit.
[2023-03-11 02:18:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-11 02:18:42] [INFO ] Invariant cache hit.
[2023-03-11 02:18:42] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/213 places, 168/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 204/213 places, 168/177 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s197 0) (EQ s80 1) (EQ s172 1))], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 431 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLCardinality-06 finished in 955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 111 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 206 transition count 139
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 176 transition count 139
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 62 place count 176 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 149 place count 128 transition count 100
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 157 place count 120 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 2 with 9 rules applied. Total rules applied 166 place count 119 transition count 92
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 107 rules applied. Total rules applied 273 place count 65 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 274 place count 64 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 63 transition count 38
Applied a total of 275 rules in 18 ms. Remains 63 /213 variables (removed 150) and now considering 38/177 (removed 139) transitions.
// Phase 1: matrix 38 rows 63 cols
[2023-03-11 02:18:42] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 02:18:43] [INFO ] Implicit Places using invariants in 59 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/213 places, 38/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 62/213 places, 38/177 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s58 1) (OR (EQ s17 0) (EQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-07 finished in 132 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||X(X(p1))))&&X(F(p2))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 7 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-11 02:18:43] [INFO ] Computed 41 place invariants in 3 ms
[2023-03-11 02:18:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-11 02:18:43] [INFO ] Invariant cache hit.
[2023-03-11 02:18:43] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-11 02:18:43] [INFO ] Invariant cache hit.
[2023-03-11 02:18:43] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s180 1), p2:(EQ s166 1), p1:(OR (EQ s13 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11947 reset in 180 ms.
Stack based approach found an accepted trace after 119 steps with 12 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-08 finished in 836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 112 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 206 transition count 139
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 176 transition count 139
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 62 place count 176 transition count 99
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 152 place count 126 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 119 transition count 92
Iterating global reduction 2 with 7 rules applied. Total rules applied 166 place count 119 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 277 place count 63 transition count 37
Applied a total of 277 rules in 17 ms. Remains 63 /213 variables (removed 150) and now considering 37/177 (removed 140) transitions.
// Phase 1: matrix 37 rows 63 cols
[2023-03-11 02:18:43] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-11 02:18:44] [INFO ] Implicit Places using invariants in 64 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/213 places, 37/177 transitions.
Applied a total of 0 rules in 12 ms. Remains 62 /62 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 62/213 places, 37/177 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s1 0) (NEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-11 finished in 164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 8 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-11 02:18:44] [INFO ] Computed 41 place invariants in 17 ms
[2023-03-11 02:18:44] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-11 02:18:44] [INFO ] Invariant cache hit.
[2023-03-11 02:18:44] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-11 02:18:44] [INFO ] Invariant cache hit.
[2023-03-11 02:18:44] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s26 0) (EQ s185 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3270 steps with 35 reset in 32 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-13 finished in 577 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(X(X(G(p0))))))'
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 169
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 203 transition count 167
Applied a total of 20 rules in 14 ms. Remains 203 /213 variables (removed 10) and now considering 167/177 (removed 10) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-11 02:18:44] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:18:44] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 02:18:44] [INFO ] Invariant cache hit.
[2023-03-11 02:18:44] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-11 02:18:44] [INFO ] Invariant cache hit.
[2023-03-11 02:18:45] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/213 places, 167/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 203/213 places, 167/177 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s191 0) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1176 reset in 231 ms.
Product exploration explored 100000 steps with 1192 reset in 237 ms.
Computed a total of 197 stabilizing places and 159 stable transitions
Graph (complete) has 430 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 197 stabilizing places and 159 stable transitions
Detected a total of 197/203 stabilizing places and 159/167 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2446008 steps, run timeout after 3001 ms. (steps per millisecond=815 ) properties seen :{}
Probabilistic random walk after 2446008 steps, saw 287498 distinct states, run finished after 3002 ms. (steps per millisecond=814 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:18:49] [INFO ] Invariant cache hit.
[2023-03-11 02:18:49] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:18:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2023-03-11 02:18:49] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:18:49] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2023-03-11 02:18:49] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2023-03-11 02:18:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2023-03-11 02:18:49] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-11 02:18:49] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 418 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 135
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 174 transition count 135
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 48 place count 174 transition count 95
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 138 place count 124 transition count 95
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 260 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 34
Applied a total of 262 rules in 18 ms. Remains 60 /203 variables (removed 143) and now considering 34/167 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 60/203 places, 34/167 transitions.
Incomplete random walk after 10000 steps, including 475 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished Best-First random walk after 530 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=265 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2023-03-11 02:18:49] [INFO ] Invariant cache hit.
[2023-03-11 02:18:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 02:18:50] [INFO ] Invariant cache hit.
[2023-03-11 02:18:50] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-11 02:18:50] [INFO ] Invariant cache hit.
[2023-03-11 02:18:50] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 203/203 places, 167/167 transitions.
Computed a total of 197 stabilizing places and 159 stable transitions
Graph (complete) has 430 edges and 203 vertex of which 202 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 197 stabilizing places and 159 stable transitions
Detected a total of 197/203 stabilizing places and 159/167 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2325550 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :{}
Probabilistic random walk after 2325550 steps, saw 274837 distinct states, run finished after 3001 ms. (steps per millisecond=774 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:18:53] [INFO ] Invariant cache hit.
[2023-03-11 02:18:53] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:18:53] [INFO ] [Nat]Absence check using 41 positive place invariants in 12 ms returned sat
[2023-03-11 02:18:53] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:18:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-11 02:18:54] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2023-03-11 02:18:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-11 02:18:54] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 02:18:54] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 418 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 135
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 48 place count 174 transition count 135
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 48 place count 174 transition count 95
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 138 place count 124 transition count 95
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 260 place count 62 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 34
Applied a total of 262 rules in 19 ms. Remains 60 /203 variables (removed 143) and now considering 34/167 (removed 133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 60/203 places, 34/167 transitions.
Finished random walk after 1787 steps, including 82 resets, run visited all 1 properties in 3 ms. (steps per millisecond=595 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 6 states, 7 edges and 1 AP (stutter sensitive) to 6 states, 7 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1189 reset in 172 ms.
Product exploration explored 100000 steps with 1180 reset in 169 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Graph (trivial) has 101 edges and 203 vertex of which 6 / 203 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 423 edges and 198 vertex of which 197 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 25 place count 197 transition count 160
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 25 place count 197 transition count 186
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 54 place count 197 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 189 transition count 171
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 189 transition count 171
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 141 place count 189 transition count 171
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 156 place count 174 transition count 156
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 171 place count 174 transition count 156
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 171 rules in 48 ms. Remains 174 /203 variables (removed 29) and now considering 156/167 (removed 11) transitions.
[2023-03-11 02:18:55] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 156 rows 174 cols
[2023-03-11 02:18:55] [INFO ] Computed 41 place invariants in 2 ms
[2023-03-11 02:18:55] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 174/203 places, 156/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 174/203 places, 156/167 transitions.
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 167/167 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 203 cols
[2023-03-11 02:18:55] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-11 02:18:56] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-11 02:18:56] [INFO ] Invariant cache hit.
[2023-03-11 02:18:56] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-11 02:18:56] [INFO ] Invariant cache hit.
[2023-03-11 02:18:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 203/203 places, 167/167 transitions.
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 11690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 107 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 206 transition count 142
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 179 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 178 transition count 141
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 58 place count 178 transition count 104
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 139 place count 134 transition count 104
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 146 place count 127 transition count 97
Ensure Unique test removed 1 places
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 126 transition count 97
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 113 rules applied. Total rules applied 267 place count 69 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 68 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 269 place count 67 transition count 40
Applied a total of 269 rules in 23 ms. Remains 67 /213 variables (removed 146) and now considering 40/177 (removed 137) transitions.
// Phase 1: matrix 40 rows 67 cols
[2023-03-11 02:18:56] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-11 02:18:56] [INFO ] Implicit Places using invariants in 50 ms returned [60, 61, 62]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/213 places, 40/177 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 64/213 places, 40/177 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s11 1) (AND (EQ s14 1) (EQ s51 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15529 reset in 175 ms.
Product exploration explored 100000 steps with 15563 reset in 201 ms.
Computed a total of 64 stabilizing places and 39 stable transitions
Computed a total of 64 stabilizing places and 39 stable transitions
Detected a total of 64/64 stabilizing places and 39/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 183 steps, including 38 resets, run visited all 1 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 64 cols
[2023-03-11 02:18:57] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-11 02:18:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-11 02:18:57] [INFO ] Invariant cache hit.
[2023-03-11 02:18:57] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 12, 16, 17, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 52]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 171 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/64 places, 40/40 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 36
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 33 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 31 transition count 34
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 28 transition count 31
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 28 transition count 31
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 28 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 22 place count 26 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 26 place count 24 transition count 27
Applied a total of 26 rules in 8 ms. Remains 24 /37 variables (removed 13) and now considering 27/40 (removed 13) transitions.
// Phase 1: matrix 27 rows 24 cols
[2023-03-11 02:18:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 02:18:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 02:18:57] [INFO ] Invariant cache hit.
[2023-03-11 02:18:57] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/64 places, 27/40 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 24/64 places, 27/40 transitions.
Computed a total of 24 stabilizing places and 26 stable transitions
Computed a total of 24 stabilizing places and 26 stable transitions
Detected a total of 24/24 stabilizing places and 26/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 21 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16189 reset in 90 ms.
Product exploration explored 100000 steps with 16261 reset in 81 ms.
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2023-03-11 02:18:58] [INFO ] Invariant cache hit.
[2023-03-11 02:18:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-11 02:18:58] [INFO ] Invariant cache hit.
[2023-03-11 02:18:58] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-11 02:18:58] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-11 02:18:58] [INFO ] Invariant cache hit.
[2023-03-11 02:18:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 24/24 places, 27/27 transitions.
Treatment of property BusinessProcesses-PT-03-LTLCardinality-15 finished in 2526 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(X(X(G(p0))))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-03-LTLCardinality-14
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 213/213 places, 177/177 transitions.
Graph (trivial) has 111 edges and 213 vertex of which 6 / 213 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 208 vertex of which 207 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 206 transition count 139
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 176 transition count 139
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 62 place count 176 transition count 99
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 152 place count 126 transition count 99
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 159 place count 119 transition count 92
Ensure Unique test removed 1 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 167 place count 118 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 111 rules applied. Total rules applied 278 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 279 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 280 place count 60 transition count 36
Applied a total of 280 rules in 20 ms. Remains 60 /213 variables (removed 153) and now considering 36/177 (removed 141) transitions.
// Phase 1: matrix 36 rows 60 cols
[2023-03-11 02:18:59] [INFO ] Computed 28 place invariants in 0 ms
[2023-03-11 02:18:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 02:18:59] [INFO ] Invariant cache hit.
[2023-03-11 02:18:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 40, 42, 44]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 131 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 33/213 places, 36/177 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 33 transition count 31
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 28 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 25 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 25 transition count 28
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 25 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 23 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 26 place count 20 transition count 23
Applied a total of 26 rules in 4 ms. Remains 20 /33 variables (removed 13) and now considering 23/36 (removed 13) transitions.
// Phase 1: matrix 23 rows 20 cols
[2023-03-11 02:18:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 02:18:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 02:18:59] [INFO ] Invariant cache hit.
[2023-03-11 02:18:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 20/213 places, 23/177 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 212 ms. Remains : 20/213 places, 23/177 transitions.
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (EQ s16 0) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24000 steps with 4713 reset in 16 ms.
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 524 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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)))'
[2023-03-11 02:18:59] [INFO ] Flatten gal took : 13 ms
[2023-03-11 02:18:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:18:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 213 places, 177 transitions and 510 arcs took 3 ms.
Total runtime 21342 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-03
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA BusinessProcesses-PT-03-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678501199853

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/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 # 4 (type EXCL) for 3 BusinessProcesses-PT-03-LTLCardinality-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-03-LTLCardinality-15
lola: result : true
lola: markings : 70
lola: fired transitions : 140
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-03-LTLCardinality-14
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 4/32 BusinessProcesses-PT-03-LTLCardinality-14 501067 m, 100213 m/sec, 3786844 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 7/32 BusinessProcesses-PT-03-LTLCardinality-14 1000427 m, 99872 m/sec, 7800330 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 10/32 BusinessProcesses-PT-03-LTLCardinality-14 1468288 m, 93572 m/sec, 11775981 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 13/32 BusinessProcesses-PT-03-LTLCardinality-14 1891867 m, 84715 m/sec, 15557931 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 16/32 BusinessProcesses-PT-03-LTLCardinality-14 2302015 m, 82029 m/sec, 19270871 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 18/32 BusinessProcesses-PT-03-LTLCardinality-14 2662183 m, 72033 m/sec, 22772514 t fired, .

Time elapsed: 30 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 21/32 BusinessProcesses-PT-03-LTLCardinality-14 3029220 m, 73407 m/sec, 26207756 t fired, .

Time elapsed: 35 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 23/32 BusinessProcesses-PT-03-LTLCardinality-14 3412560 m, 76668 m/sec, 29713713 t fired, .

Time elapsed: 40 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 26/32 BusinessProcesses-PT-03-LTLCardinality-14 3789368 m, 75361 m/sec, 33234437 t fired, .

Time elapsed: 45 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 28/32 BusinessProcesses-PT-03-LTLCardinality-14 4134710 m, 69068 m/sec, 36657277 t fired, .

Time elapsed: 50 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 30/32 BusinessProcesses-PT-03-LTLCardinality-14 4548559 m, 82769 m/sec, 40441534 t fired, .

Time elapsed: 55 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for BusinessProcesses-PT-03-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
BusinessProcesses-PT-03-LTLCardinality-14: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 60 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
BusinessProcesses-PT-03-LTLCardinality-14: LTL unknown AGGR
BusinessProcesses-PT-03-LTLCardinality-15: LTL true LTL model checker


Time elapsed: 60 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="BusinessProcesses-PT-03"
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 BusinessProcesses-PT-03, 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 r039-tajo-167813692600467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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