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-167813692600515.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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.8K 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.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 104K 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-09-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678502373417

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-09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:39:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:39:35] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-11 02:39:35] [INFO ] Transformed 403 places.
[2023-03-11 02:39:35] [INFO ] Transformed 374 transitions.
[2023-03-11 02:39:35] [INFO ] Found NUPN structural information;
[2023-03-11 02:39:35] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 53 place count 350 transition count 322
Iterating global reduction 1 with 52 rules applied. Total rules applied 105 place count 350 transition count 322
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 122 place count 333 transition count 305
Iterating global reduction 1 with 17 rules applied. Total rules applied 139 place count 333 transition count 305
Applied a total of 139 rules in 68 ms. Remains 333 /403 variables (removed 70) and now considering 305/374 (removed 69) transitions.
// Phase 1: matrix 305 rows 333 cols
[2023-03-11 02:39:35] [INFO ] Computed 64 place invariants in 14 ms
[2023-03-11 02:39:35] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-11 02:39:35] [INFO ] Invariant cache hit.
[2023-03-11 02:39:35] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-11 02:39:35] [INFO ] Invariant cache hit.
[2023-03-11 02:39:36] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/403 places, 305/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 805 ms. Remains : 333/403 places, 305/374 transitions.
Support contains 33 out of 333 places after structural reductions.
[2023-03-11 02:39:36] [INFO ] Flatten gal took : 42 ms
[2023-03-11 02:39:36] [INFO ] Flatten gal took : 20 ms
[2023-03-11 02:39:36] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 28 out of 333 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 02:39:36] [INFO ] Invariant cache hit.
[2023-03-11 02:39:36] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:39:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-11 02:39:36] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 6 ms returned sat
[2023-03-11 02:39:37] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 3 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2023-03-11 02:39:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 624 ms
[2023-03-11 02:39:37] [INFO ] After 786ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-11 02:39:37] [INFO ] After 913ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 149 edges and 333 vertex of which 6 / 333 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 764 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 327 transition count 268
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 298 transition count 268
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 60 place count 298 transition count 199
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 208 place count 219 transition count 199
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 215 place count 212 transition count 192
Iterating global reduction 2 with 7 rules applied. Total rules applied 222 place count 212 transition count 192
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 383 place count 130 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 385 place count 129 transition count 116
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 129 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 389 place count 127 transition count 114
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 127 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 391 place count 126 transition count 113
Applied a total of 391 rules in 86 ms. Remains 126 /333 variables (removed 207) and now considering 113/305 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 126/333 places, 113/305 transitions.
Incomplete random walk after 10000 steps, including 543 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 208 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 113 rows 126 cols
[2023-03-11 02:39:38] [INFO ] Computed 51 place invariants in 6 ms
[2023-03-11 02:39:38] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:39:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-11 02:39:38] [INFO ] [Nat]Absence check using 35 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-11 02:39:38] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:38] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:39:38] [INFO ] After 12ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:38] [INFO ] After 24ms 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:39:38] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 113/113 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 125 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 124 transition count 111
Applied a total of 4 rules in 11 ms. Remains 124 /126 variables (removed 2) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 124/126 places, 111/113 transitions.
Incomplete random walk after 10000 steps, including 557 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 227 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1298950 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :{}
Probabilistic random walk after 1298950 steps, saw 440559 distinct states, run finished after 3004 ms. (steps per millisecond=432 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 124 cols
[2023-03-11 02:39:41] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-11 02:39:41] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:39:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-11 02:39:41] [INFO ] [Nat]Absence check using 34 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-11 02:39:41] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:39:41] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:41] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-11 02:39:41] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 124/124 places, 111/111 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 124 /124 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-03-11 02:39:41] [INFO ] Invariant cache hit.
[2023-03-11 02:39:41] [INFO ] Implicit Places using invariants in 81 ms returned [10, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 83 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/124 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 122 /122 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 91 ms. Remains : 122/124 places, 111/111 transitions.
Incomplete random walk after 10000 steps, including 545 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1767259 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :{}
Probabilistic random walk after 1767259 steps, saw 567787 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 122 cols
[2023-03-11 02:39:44] [INFO ] Computed 49 place invariants in 10 ms
[2023-03-11 02:39:44] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:39:44] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2023-03-11 02:39:44] [INFO ] [Nat]Absence check using 32 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-11 02:39:44] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:39:44] [INFO ] After 18ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:44] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 02:39:44] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 200 stabilizing places and 202 stable transitions
Graph (complete) has 771 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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&&X(p0))))))'
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 324 transition count 296
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 324 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 17 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-11 02:39:45] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-11 02:39:45] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-11 02:39:45] [INFO ] Invariant cache hit.
[2023-03-11 02:39:45] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2023-03-11 02:39:45] [INFO ] Invariant cache hit.
[2023-03-11 02:39:45] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s309 0) (EQ s66 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 339 steps with 2 reset in 5 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-00 finished in 925 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 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 326 transition count 264
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 293 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 292 transition count 263
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 70 place count 292 transition count 195
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 216 place count 214 transition count 195
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 204 transition count 185
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 204 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 236 place count 204 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 203 transition count 184
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 395 place count 123 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 397 place count 122 transition count 110
Applied a total of 397 rules in 35 ms. Remains 122 /333 variables (removed 211) and now considering 110/305 (removed 195) transitions.
// Phase 1: matrix 110 rows 122 cols
[2023-03-11 02:39:45] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-11 02:39:45] [INFO ] Implicit Places using invariants in 67 ms returned [1, 2, 3, 37, 38, 39, 40, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 68 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/333 places, 110/305 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 112/333 places, 110/305 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s9 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 30 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-01 finished in 149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 317 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 317 transition count 289
Applied a total of 32 rules in 28 ms. Remains 317 /333 variables (removed 16) and now considering 289/305 (removed 16) transitions.
// Phase 1: matrix 289 rows 317 cols
[2023-03-11 02:39:46] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-11 02:39:46] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-11 02:39:46] [INFO ] Invariant cache hit.
[2023-03-11 02:39:46] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-11 02:39:46] [INFO ] Invariant cache hit.
[2023-03-11 02:39:46] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/333 places, 289/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 317/333 places, 289/305 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s276 0) (EQ s227 1)), p1:(AND (EQ s100 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1469 reset in 234 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-06 finished in 913 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((X((F(p2)&&p1))||p0)))'
Support contains 6 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 327 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 327 transition count 299
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 325 transition count 297
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 325 transition count 297
Applied a total of 16 rules in 42 ms. Remains 325 /333 variables (removed 8) and now considering 297/305 (removed 8) transitions.
// Phase 1: matrix 297 rows 325 cols
[2023-03-11 02:39:47] [INFO ] Computed 64 place invariants in 3 ms
[2023-03-11 02:39:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-11 02:39:47] [INFO ] Invariant cache hit.
[2023-03-11 02:39:47] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-11 02:39:47] [INFO ] Invariant cache hit.
[2023-03-11 02:39:47] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 325/333 places, 297/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 325/333 places, 297/305 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s80 0) (EQ s288 1) (EQ s67 0) (EQ s4 1)), p1:(AND (EQ s4 0) (EQ s67 1)), p2:(OR (AND (EQ s288 0) (EQ s80 1)) (AND (EQ s318 0) (EQ s254 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][false, false, false, false]]
Product exploration explored 100000 steps with 1047 reset in 261 ms.
Product exploration explored 100000 steps with 1044 reset in 244 ms.
Computed a total of 195 stabilizing places and 197 stable transitions
Graph (complete) has 759 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 195 stabilizing places and 197 stable transitions
Detected a total of 195/325 stabilizing places and 197/297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 307 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 02:39:48] [INFO ] Invariant cache hit.
[2023-03-11 02:39:48] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 02:39:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-11 02:39:48] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-11 02:39:49] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 02:39:49] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2023-03-11 02:39:49] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2023-03-11 02:39:49] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 0 ms to minimize.
[2023-03-11 02:39:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
[2023-03-11 02:39:49] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-11 02:39:49] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 140 edges and 325 vertex of which 6 / 325 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 752 edges and 320 vertex of which 319 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 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 319 transition count 260
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 290 transition count 260
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 60 place count 290 transition count 194
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 202 place count 214 transition count 194
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 365 place count 131 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 130 transition count 117
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 369 place count 130 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 371 place count 128 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 128 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 127 transition count 114
Applied a total of 373 rules in 39 ms. Remains 127 /325 variables (removed 198) and now considering 114/297 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 127/325 places, 114/297 transitions.
Incomplete random walk after 10000 steps, including 498 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :2
Finished Best-First random walk after 9120 steps, including 194 resets, run visited all 1 properties in 18 ms. (steps per millisecond=506 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 7 factoid took 378 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Applied a total of 0 rules in 5 ms. Remains 325 /325 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2023-03-11 02:39:50] [INFO ] Invariant cache hit.
[2023-03-11 02:39:50] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 02:39:50] [INFO ] Invariant cache hit.
[2023-03-11 02:39:50] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-11 02:39:50] [INFO ] Invariant cache hit.
[2023-03-11 02:39:50] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 562 ms. Remains : 325/325 places, 297/297 transitions.
Computed a total of 195 stabilizing places and 197 stable transitions
Graph (complete) has 759 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 195 stabilizing places and 197 stable transitions
Detected a total of 195/325 stabilizing places and 197/297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 105 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:39:51] [INFO ] Invariant cache hit.
[2023-03-11 02:39:51] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:39:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-11 02:39:51] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-11 02:39:51] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:39:51] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 0 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 0 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 0 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2023-03-11 02:39:52] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 0 ms to minimize.
[2023-03-11 02:39:53] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 0 ms to minimize.
[2023-03-11 02:39:53] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1315 ms
[2023-03-11 02:39:53] [INFO ] After 1462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-11 02:39:53] [INFO ] After 1579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 143 edges and 325 vertex of which 6 / 325 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 752 edges and 320 vertex of which 319 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 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 319 transition count 259
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 289 transition count 259
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 62 place count 289 transition count 192
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 206 place count 212 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 211 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 211 transition count 191
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 371 place count 128 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 127 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 127 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 377 place count 125 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 125 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 124 transition count 111
Applied a total of 379 rules in 46 ms. Remains 124 /325 variables (removed 201) and now considering 111/297 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 124/325 places, 111/297 transitions.
Incomplete random walk after 10000 steps, including 543 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 1059 reset in 222 ms.
Product exploration explored 100000 steps with 1058 reset in 233 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 140 edges and 325 vertex of which 6 / 325 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 753 edges and 320 vertex of which 319 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 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 319 transition count 290
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 31 place count 319 transition count 320
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 79 place count 319 transition count 320
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 309 transition count 301
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 309 transition count 301
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 196 place count 309 transition count 301
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 220 place count 285 transition count 277
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 244 place count 285 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 245 place count 285 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 246 place count 284 transition count 289
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 247 place count 284 transition count 289
Deduced a syphon composed of 140 places in 0 ms
Applied a total of 247 rules in 68 ms. Remains 284 /325 variables (removed 41) and now considering 289/297 (removed 8) transitions.
[2023-03-11 02:39:54] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 289 rows 284 cols
[2023-03-11 02:39:54] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-11 02:39:54] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/325 places, 289/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 284/325 places, 289/297 transitions.
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Applied a total of 0 rules in 9 ms. Remains 325 /325 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 325 cols
[2023-03-11 02:39:54] [INFO ] Computed 64 place invariants in 3 ms
[2023-03-11 02:39:55] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-11 02:39:55] [INFO ] Invariant cache hit.
[2023-03-11 02:39:55] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2023-03-11 02:39:55] [INFO ] Invariant cache hit.
[2023-03-11 02:39:55] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 325/325 places, 297/297 transitions.
Treatment of property BusinessProcesses-PT-09-LTLCardinality-08 finished in 8698 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 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 327 transition count 265
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 294 transition count 265
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 67 place count 294 transition count 197
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 213 place count 216 transition count 197
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 222 place count 207 transition count 188
Iterating global reduction 2 with 9 rules applied. Total rules applied 231 place count 207 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 231 place count 207 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 233 place count 206 transition count 187
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 396 place count 123 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 398 place count 122 transition count 110
Applied a total of 398 rules in 29 ms. Remains 122 /333 variables (removed 211) and now considering 110/305 (removed 195) transitions.
// Phase 1: matrix 110 rows 122 cols
[2023-03-11 02:39:55] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-11 02:39:55] [INFO ] Implicit Places using invariants in 73 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 75 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/333 places, 110/305 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 111/333 places, 110/305 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18837 reset in 251 ms.
Product exploration explored 100000 steps with 18908 reset in 262 ms.
Computed a total of 68 stabilizing places and 82 stable transitions
Graph (complete) has 478 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 68 stabilizing places and 82 stable transitions
Detected a total of 68/111 stabilizing places and 82/110 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 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 25 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
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 201 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 111 cols
[2023-03-11 02:39:56] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-11 02:39:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-11 02:39:56] [INFO ] Invariant cache hit.
[2023-03-11 02:39:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:39:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned [10, 38, 58, 60, 66, 68]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 249 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/111 places, 110/110 transitions.
Graph (complete) has 397 edges and 105 vertex of which 96 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 95 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 85 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 85 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 84 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 84 transition count 66
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 2 with 4 rules applied. Total rules applied 29 place count 82 transition count 64
Applied a total of 29 rules in 11 ms. Remains 82 /105 variables (removed 23) and now considering 64/110 (removed 46) transitions.
// Phase 1: matrix 64 rows 82 cols
[2023-03-11 02:39:57] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 02:39:57] [INFO ] Implicit Places using invariants in 56 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 59 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/111 places, 64/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 328 ms. Remains : 79/111 places, 64/110 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 252 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 36 stabilizing places and 36 stable transitions
Detected a total of 36/79 stabilizing places and 36/64 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 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 77 steps, including 18 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19592 reset in 173 ms.
Product exploration explored 100000 steps with 19566 reset in 149 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 79 cols
[2023-03-11 02:39:57] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-11 02:39:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 02:39:57] [INFO ] Invariant cache hit.
[2023-03-11 02:39:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [33, 36, 38]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/79 places, 64/64 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 61
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 73 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 72 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 72 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 72 transition count 59
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 32 place count 58 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 55 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 55 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 55 transition count 46
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 4 with 2 rules applied. Total rules applied 41 place count 54 transition count 45
Applied a total of 41 rules in 8 ms. Remains 54 /76 variables (removed 22) and now considering 45/64 (removed 19) transitions.
// Phase 1: matrix 45 rows 54 cols
[2023-03-11 02:39:58] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-11 02:39:58] [INFO ] Invariant cache hit.
[2023-03-11 02:39:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/79 places, 45/64 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 54/79 places, 45/64 transitions.
Treatment of property BusinessProcesses-PT-09-LTLCardinality-09 finished in 2507 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 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 326 transition count 264
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 293 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 292 transition count 263
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 70 place count 292 transition count 195
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 216 place count 214 transition count 195
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 225 place count 205 transition count 186
Iterating global reduction 3 with 9 rules applied. Total rules applied 234 place count 205 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 205 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 204 transition count 185
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 397 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 121 transition count 109
Applied a total of 399 rules in 20 ms. Remains 121 /333 variables (removed 212) and now considering 109/305 (removed 196) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-11 02:39:58] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants in 75 ms returned [1, 2, 3, 11, 36, 37, 38, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 76 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/333 places, 109/305 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 111/333 places, 109/305 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-10 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 s33 0) (NEQ s71 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-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-10 finished in 135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 10 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-11 02:39:58] [INFO ] Computed 64 place invariants in 1 ms
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 02:39:58] [INFO ] Invariant cache hit.
[2023-03-11 02:39:58] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-11 02:39:58] [INFO ] Invariant cache hit.
[2023-03-11 02:39:58] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s250 1), p1:(OR (EQ s285 0) (EQ s248 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 749 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-09-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLCardinality-11 finished in 1181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&F(p2)&&p0)))'
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 324 transition count 296
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 324 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 23 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-11 02:39:59] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-11 02:39:59] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-11 02:39:59] [INFO ] Invariant cache hit.
[2023-03-11 02:39:59] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-11 02:39:59] [INFO ] Invariant cache hit.
[2023-03-11 02:39:59] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 469 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s244 0) (EQ s255 1)), p2:(OR (EQ s313 0) (EQ s257 1)), p0:(AND (EQ s257 0) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-12 finished in 663 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 317 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 317 transition count 289
Applied a total of 32 rules in 15 ms. Remains 317 /333 variables (removed 16) and now considering 289/305 (removed 16) transitions.
// Phase 1: matrix 289 rows 317 cols
[2023-03-11 02:40:00] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-11 02:40:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-11 02:40:00] [INFO ] Invariant cache hit.
[2023-03-11 02:40:00] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-11 02:40:00] [INFO ] Invariant cache hit.
[2023-03-11 02:40:00] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/333 places, 289/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 585 ms. Remains : 317/333 places, 289/305 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s146 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-13 finished in 674 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((X((F(p2)&&p1))||p0)))'
Found a Lengthening insensitive property : BusinessProcesses-PT-09-LTLCardinality-08
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 333 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 148 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 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 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 326 transition count 267
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 296 transition count 267
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 62 place count 296 transition count 200
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 206 place count 219 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 213 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 213 transition count 194
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 379 place count 131 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 130 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 129 transition count 117
Applied a total of 382 rules in 24 ms. Remains 129 /333 variables (removed 204) and now considering 117/305 (removed 188) transitions.
// Phase 1: matrix 117 rows 129 cols
[2023-03-11 02:40:01] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-11 02:40:01] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 02:40:01] [INFO ] Invariant cache hit.
[2023-03-11 02:40:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:40:01] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [53, 73, 75, 81, 83]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 210 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/333 places, 117/305 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 123 transition count 116
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 120 transition count 113
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 113/117 (removed 4) transitions.
// Phase 1: matrix 113 rows 120 cols
[2023-03-11 02:40:01] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-11 02:40:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-11 02:40:01] [INFO ] Invariant cache hit.
[2023-03-11 02:40:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 02:40:01] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [17, 42, 44, 45]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 207 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 116/333 places, 113/305 transitions.
Graph (complete) has 435 edges and 116 vertex of which 107 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 99 transition count 77
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 99 transition count 77
Applied a total of 17 rules in 3 ms. Remains 99 /116 variables (removed 17) and now considering 77/113 (removed 36) transitions.
// Phase 1: matrix 77 rows 99 cols
[2023-03-11 02:40:01] [INFO ] Computed 37 place invariants in 0 ms
[2023-03-11 02:40:01] [INFO ] Implicit Places using invariants in 56 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 97/333 places, 77/305 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 507 ms. Remains : 97/333 places, 77/305 transitions.
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s71 1) (EQ s14 0) (EQ s1 1)), p1:(AND (EQ s1 0) (EQ s14 1)), p2:(OR (AND (EQ s71 0) (EQ s17 1)) (AND (EQ s92 0) (EQ s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 15067 steps with 2209 reset in 20 ms.
Treatment of property BusinessProcesses-PT-09-LTLCardinality-08 finished in 776 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-08 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' '!(F(G(p0)))'
[2023-03-11 02:40:01] [INFO ] Flatten gal took : 37 ms
[2023-03-11 02:40:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 02:40:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 333 places, 305 transitions and 1009 arcs took 5 ms.
Total runtime 26698 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-09
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

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

BK_STOP 1678502477049

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-09-LTLCardinality-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-09-LTLCardinality-09
lola: result : true
lola: markings : 1680385
lola: fired transitions : 3229058
lola: time used : 5.000000
lola: memory pages used : 12
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-09-LTLCardinality-08
lola: time limit : 3595 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-09-LTLCardinality-09: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 0/3595 1/32 BusinessProcesses-PT-09-LTLCardinality-08 2499 m, 499 m/sec, 9595 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3595 3/32 BusinessProcesses-PT-09-LTLCardinality-08 377817 m, 75063 m/sec, 2557259 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3595 6/32 BusinessProcesses-PT-09-LTLCardinality-08 758524 m, 76141 m/sec, 5350669 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3595 8/32 BusinessProcesses-PT-09-LTLCardinality-08 1124623 m, 73219 m/sec, 8353751 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3595 11/32 BusinessProcesses-PT-09-LTLCardinality-08 1508203 m, 76716 m/sec, 11368623 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3595 13/32 BusinessProcesses-PT-09-LTLCardinality-08 1844043 m, 67168 m/sec, 14205740 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3595 15/32 BusinessProcesses-PT-09-LTLCardinality-08 2161236 m, 63438 m/sec, 16926691 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3595 17/32 BusinessProcesses-PT-09-LTLCardinality-08 2429433 m, 53639 m/sec, 19433577 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3595 19/32 BusinessProcesses-PT-09-LTLCardinality-08 2769526 m, 68018 m/sec, 22177187 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3595 22/32 BusinessProcesses-PT-09-LTLCardinality-08 3117840 m, 69662 m/sec, 25128919 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3595 24/32 BusinessProcesses-PT-09-LTLCardinality-08 3443165 m, 65065 m/sec, 27921367 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3595 26/32 BusinessProcesses-PT-09-LTLCardinality-08 3728321 m, 57031 m/sec, 30622579 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3595 28/32 BusinessProcesses-PT-09-LTLCardinality-08 4072819 m, 68899 m/sec, 33330728 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3595 31/32 BusinessProcesses-PT-09-LTLCardinality-08 4392700 m, 63976 m/sec, 36068516 t fired, .

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

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

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

Time elapsed: 75 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-09-LTLCardinality-08: LTL unknown AGGR
BusinessProcesses-PT-09-LTLCardinality-09: LTL true LTL model checker


Time elapsed: 75 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-09"
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-09, 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-167813692600515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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