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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 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.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 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 177K 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678503578686

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-18
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:59:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:59:40] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-11 02:59:40] [INFO ] Transformed 717 places.
[2023-03-11 02:59:40] [INFO ] Transformed 642 transitions.
[2023-03-11 02:59:40] [INFO ] Found NUPN structural information;
[2023-03-11 02:59:40] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 109 place count 593 transition count 526
Iterating global reduction 1 with 101 rules applied. Total rules applied 210 place count 593 transition count 526
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 211 place count 593 transition count 525
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 264 place count 540 transition count 472
Iterating global reduction 2 with 53 rules applied. Total rules applied 317 place count 540 transition count 472
Applied a total of 317 rules in 145 ms. Remains 540 /702 variables (removed 162) and now considering 472/627 (removed 155) transitions.
// Phase 1: matrix 472 rows 540 cols
[2023-03-11 02:59:40] [INFO ] Computed 106 place invariants in 30 ms
[2023-03-11 02:59:41] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-11 02:59:41] [INFO ] Invariant cache hit.
[2023-03-11 02:59:41] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2023-03-11 02:59:41] [INFO ] Invariant cache hit.
[2023-03-11 02:59:41] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 540/702 places, 472/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1266 ms. Remains : 540/702 places, 472/627 transitions.
Support contains 20 out of 540 places after structural reductions.
[2023-03-11 02:59:41] [INFO ] Flatten gal took : 55 ms
[2023-03-11 02:59:42] [INFO ] Flatten gal took : 36 ms
[2023-03-11 02:59:42] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-11 02:59:42] [INFO ] Invariant cache hit.
[2023-03-11 02:59:42] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-11 02:59:42] [INFO ] [Real]Absence check using 63 positive and 43 generalized place invariants in 9 ms returned sat
[2023-03-11 02:59:42] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 02:59:42] [INFO ] [Nat]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-11 02:59:42] [INFO ] [Nat]Absence check using 63 positive and 43 generalized place invariants in 11 ms returned sat
[2023-03-11 02:59:43] [INFO ] After 267ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 17 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 243 ms
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 1 ms to minimize.
[2023-03-11 02:59:43] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 0 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 769 ms
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 80 places in 215 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 1 ms to minimize.
[2023-03-11 02:59:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2023-03-11 02:59:44] [INFO ] After 1984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-11 02:59:45] [INFO ] After 2346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 88 ms.
Support contains 9 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 248 edges and 540 vertex of which 6 / 540 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 1197 edges and 535 vertex of which 534 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 534 transition count 404
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 474 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 473 transition count 403
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 124 place count 473 transition count 291
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 373 place count 336 transition count 291
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 375 place count 334 transition count 289
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 334 transition count 289
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 662 place count 190 transition count 148
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 664 place count 189 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 665 place count 189 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 666 place count 188 transition count 150
Applied a total of 666 rules in 107 ms. Remains 188 /540 variables (removed 352) and now considering 150/472 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 188/540 places, 150/472 transitions.
Incomplete random walk after 10000 steps, including 511 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 203 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 150 rows 188 cols
[2023-03-11 02:59:45] [INFO ] Computed 78 place invariants in 8 ms
[2023-03-11 02:59:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 10 ms returned sat
[2023-03-11 02:59:45] [INFO ] [Nat]Absence check using 65 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-11 02:59:45] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-11 02:59:45] [INFO ] After 12ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:45] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2023-03-11 02:59:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-11 02:59:45] [INFO ] After 92ms 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:59:45] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 1 ms.
Computed a total of 484 stabilizing places and 426 stable transitions
Graph (complete) has 1212 edges and 540 vertex of which 539 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 534 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 531 transition count 463
Applied a total of 18 rules in 49 ms. Remains 531 /540 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 531 cols
[2023-03-11 02:59:46] [INFO ] Computed 106 place invariants in 9 ms
[2023-03-11 02:59:46] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-11 02:59:46] [INFO ] Invariant cache hit.
[2023-03-11 02:59:46] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-11 02:59:46] [INFO ] Invariant cache hit.
[2023-03-11 02:59:47] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/540 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 531/540 places, 463/472 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s229 0) (EQ s169 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 48774 steps with 256 reset in 183 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 1406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 471 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 128 place count 470 transition count 289
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 377 place count 333 transition count 289
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 381 place count 329 transition count 285
Iterating global reduction 3 with 4 rules applied. Total rules applied 385 place count 329 transition count 285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 385 place count 329 transition count 284
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 387 place count 328 transition count 284
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 289 rules applied. Total rules applied 676 place count 182 transition count 141
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 678 place count 181 transition count 144
Applied a total of 678 rules in 48 ms. Remains 181 /540 variables (removed 359) and now considering 144/472 (removed 328) transitions.
// Phase 1: matrix 144 rows 181 cols
[2023-03-11 02:59:47] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-11 02:59:47] [INFO ] Implicit Places using invariants in 102 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 103 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/540 places, 144/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 157 ms. Remains : 153/540 places, 144/472 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s123 1), p0:(AND (NEQ s34 0) (NEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9201 reset in 271 ms.
Product exploration explored 100000 steps with 9255 reset in 255 ms.
Computed a total of 131 stabilizing places and 127 stable transitions
Computed a total of 131 stabilizing places and 127 stable transitions
Detected a total of 131/153 stabilizing places and 127/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 1045 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 364 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 153 cols
[2023-03-11 02:59:48] [INFO ] Computed 50 place invariants in 3 ms
[2023-03-11 02:59:48] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-11 02:59:48] [INFO ] [Real]Absence check using 37 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-11 02:59:48] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:59:48] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2023-03-11 02:59:48] [INFO ] [Nat]Absence check using 37 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-11 02:59:48] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:59:48] [INFO ] After 16ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:59:49] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2023-03-11 02:59:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-11 02:59:49] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 02:59:49] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 144/144 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 143
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 153 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 142
Applied a total of 3 rules in 19 ms. Remains 152 /153 variables (removed 1) and now considering 142/144 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 152/153 places, 142/144 transitions.
Finished random walk after 74 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2023-03-11 02:59:49] [INFO ] Invariant cache hit.
[2023-03-11 02:59:49] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 02:59:49] [INFO ] Invariant cache hit.
[2023-03-11 02:59:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:59:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned [3, 36, 53, 55, 59, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 271 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/153 places, 144/144 transitions.
Graph (complete) has 423 edges and 130 vertex of which 121 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
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 121 transition count 129
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 110 transition count 129
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 36 place count 97 transition count 88
Iterating global reduction 2 with 13 rules applied. Total rules applied 49 place count 97 transition count 88
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 97 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 95 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 92 transition count 83
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 92 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 61 place count 92 transition count 81
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 71 place count 87 transition count 76
Applied a total of 71 rules in 14 ms. Remains 87 /130 variables (removed 43) and now considering 76/144 (removed 68) transitions.
// Phase 1: matrix 76 rows 87 cols
[2023-03-11 02:59:49] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-11 02:59:49] [INFO ] Implicit Places using invariants in 74 ms returned [3, 4, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/153 places, 76/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 370 ms. Remains : 84/153 places, 76/144 transitions.
Computed a total of 62 stabilizing places and 59 stable transitions
Computed a total of 62 stabilizing places and 59 stable transitions
Detected a total of 62/84 stabilizing places and 59/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 6 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4872 steps, including 513 resets, run visited all 2 properties in 25 ms. (steps per millisecond=194 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 9299 reset in 151 ms.
Product exploration explored 100000 steps with 9263 reset in 142 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 84 cols
[2023-03-11 02:59:51] [INFO ] Computed 19 place invariants in 10 ms
[2023-03-11 02:59:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-11 02:59:51] [INFO ] Invariant cache hit.
[2023-03-11 02:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:59:51] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [31, 34, 36]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 203 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/84 places, 76/76 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 81 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 78 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 77 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 77 transition count 72
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 2 with 23 rules applied. Total rules applied 31 place count 63 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 60 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 60 transition count 60
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 39 place count 59 transition count 59
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 59 transition count 57
Applied a total of 41 rules in 13 ms. Remains 59 /81 variables (removed 22) and now considering 57/76 (removed 19) transitions.
// Phase 1: matrix 57 rows 59 cols
[2023-03-11 02:59:51] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-11 02:59:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 02:59:51] [INFO ] Invariant cache hit.
[2023-03-11 02:59:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:59:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/84 places, 57/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 347 ms. Remains : 59/84 places, 57/76 transitions.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-04 finished in 4307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 534 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 534 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 532 transition count 464
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 531 transition count 463
Applied a total of 18 rules in 96 ms. Remains 531 /540 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 531 cols
[2023-03-11 02:59:51] [INFO ] Computed 106 place invariants in 6 ms
[2023-03-11 02:59:52] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-11 02:59:52] [INFO ] Invariant cache hit.
[2023-03-11 02:59:52] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-11 02:59:52] [INFO ] Invariant cache hit.
[2023-03-11 02:59:52] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/540 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 531/540 places, 463/472 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s385 0) (EQ s521 1) (EQ s194 0) (EQ s51 1)), p0:(AND (EQ s521 0) (EQ s385 1) (EQ s51 0) (EQ s194 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 1355 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(!p0) U ((p1&&X(!p0))||X(G(!p0)))))||(F(!p1)&&(X(!p0) U ((p1&&X(!p0))||X(G(!p0)))))))'
Support contains 4 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 535 transition count 467
Applied a total of 10 rules in 54 ms. Remains 535 /540 variables (removed 5) and now considering 467/472 (removed 5) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-11 02:59:53] [INFO ] Computed 106 place invariants in 6 ms
[2023-03-11 02:59:53] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-11 02:59:53] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2023-03-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:54] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 535/540 places, 467/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1091 ms. Remains : 535/540 places, 467/472 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, p0, p1, p0, p0, p0, (AND p1 p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (EQ s435 0) (EQ s310 1)), p1:(OR (EQ s174 0) (EQ s139 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, null, null, null][false, false, 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-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-09 finished in 1347 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(F(p0))||(!p1&&F(p0)&&F(!p2)&&X(!p3)))))'
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 535 transition count 467
Applied a total of 10 rules in 37 ms. Remains 535 /540 variables (removed 5) and now considering 467/472 (removed 5) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-11 02:59:54] [INFO ] Computed 106 place invariants in 7 ms
[2023-03-11 02:59:54] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-11 02:59:54] [INFO ] Invariant cache hit.
[2023-03-11 02:59:55] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
[2023-03-11 02:59:55] [INFO ] Invariant cache hit.
[2023-03-11 02:59:55] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 535/540 places, 467/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1156 ms. Remains : 535/540 places, 467/472 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s310 0) (EQ s483 1)), p0:(NEQ s295 1), p2:(OR (EQ s243 0) (EQ s33 1)), p3:(OR (EQ s295 1) (EQ s310 0) (EQ s483 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 631 reset in 331 ms.
Product exploration explored 100000 steps with 631 reset in 439 ms.
Computed a total of 480 stabilizing places and 422 stable transitions
Graph (complete) has 1205 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Computed a total of 480 stabilizing places and 422 stable transitions
Detected a total of 480/535 stabilizing places and 422/467 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p0) p3))), (X p2), (X p0), (X (AND p1 p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (X (NOT (AND (NOT p0) p3)))), (X (X p2)), (X (X p0)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1181 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 3768 steps, including 19 resets, run visited all 9 properties in 24 ms. (steps per millisecond=157 )
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p0) p3))), (X p2), (X p0), (X (AND p1 p3)), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p2))), (X p1), (X (X (NOT (AND (NOT p0) p3)))), (X (X p2)), (X (X p0)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p1) p3)), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT p2))]
Knowledge based reduction with 22 factoid took 1471 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Applied a total of 0 rules in 19 ms. Remains 535 /535 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:00] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-11 03:00:00] [INFO ] Invariant cache hit.
[2023-03-11 03:00:01] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1102 ms. Remains : 535/535 places, 467/467 transitions.
Computed a total of 480 stabilizing places and 422 stable transitions
Graph (complete) has 1205 edges and 535 vertex of which 534 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 480 stabilizing places and 422 stable transitions
Detected a total of 480/535 stabilizing places and 422/467 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p0), (X (AND p1 p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 p2))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1274 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Finished random walk after 2798 steps, including 14 resets, run visited all 9 properties in 19 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND p1 p0 p2 p3), (X p2), (X p0), (X (AND p1 p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p3 (NOT p0)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 p2))), (X p1), (X (X p2)), (X (X p0)), (X (X (AND p1 p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND p3 (NOT p0))), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p1) p3)), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (NOT p2))]
Knowledge based reduction with 22 factoid took 1592 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 631 reset in 227 ms.
Product exploration explored 100000 steps with 631 reset in 246 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Graph (trivial) has 250 edges and 535 vertex of which 6 / 535 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 1198 edges and 530 vertex of which 529 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 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 529 transition count 460
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 79 Pre rules applied. Total rules applied 61 place count 529 transition count 524
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 140 place count 529 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 162 place count 507 transition count 483
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 507 transition count 483
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 293 places in 0 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 361 place count 507 transition count 483
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 402 place count 466 transition count 442
Deduced a syphon composed of 252 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 443 place count 466 transition count 442
Deduced a syphon composed of 252 places in 0 ms
Applied a total of 443 rules in 105 ms. Remains 466 /535 variables (removed 69) and now considering 442/467 (removed 25) transitions.
[2023-03-11 03:00:06] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 442 rows 466 cols
[2023-03-11 03:00:06] [INFO ] Computed 106 place invariants in 9 ms
[2023-03-11 03:00:06] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 466/535 places, 442/467 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 466/535 places, 442/467 transitions.
Support contains 5 out of 535 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 535/535 places, 467/467 transitions.
Applied a total of 0 rules in 22 ms. Remains 535 /535 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 535 cols
[2023-03-11 03:00:06] [INFO ] Computed 106 place invariants in 10 ms
[2023-03-11 03:00:06] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-11 03:00:06] [INFO ] Invariant cache hit.
[2023-03-11 03:00:07] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-11 03:00:07] [INFO ] Invariant cache hit.
[2023-03-11 03:00:07] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 826 ms. Remains : 535/535 places, 467/467 transitions.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-11 finished in 12887 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 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 256 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 533 transition count 401
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 128 place count 470 transition count 288
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 379 place count 332 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 382 place count 329 transition count 285
Iterating global reduction 2 with 3 rules applied. Total rules applied 385 place count 329 transition count 285
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 680 place count 180 transition count 139
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 682 place count 179 transition count 142
Applied a total of 682 rules in 57 ms. Remains 179 /540 variables (removed 361) and now considering 142/472 (removed 330) transitions.
// Phase 1: matrix 142 rows 179 cols
[2023-03-11 03:00:07] [INFO ] Computed 78 place invariants in 2 ms
[2023-03-11 03:00:07] [INFO ] Implicit Places using invariants in 134 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 137 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/540 places, 142/472 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 151/540 places, 142/472 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-12 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 s2 0) (EQ s39 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 13657 reset in 329 ms.
Product exploration explored 100000 steps with 13563 reset in 228 ms.
Computed a total of 128 stabilizing places and 124 stable transitions
Computed a total of 128 stabilizing places and 124 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 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 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1684 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 619 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1237 steps, run visited all 1 properties in 19 ms. (steps per millisecond=65 )
Probabilistic random walk after 1237 steps, saw 480 distinct states, run finished after 19 ms. (steps per millisecond=65 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 142/142 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 151 cols
[2023-03-11 03:00:08] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-11 03:00:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-11 03:00:08] [INFO ] Invariant cache hit.
[2023-03-11 03:00:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:00:08] [INFO ] Implicit Places using invariants and state equation in 205 ms returned [5, 28, 29, 31, 33, 35, 36, 52, 54, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 302 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/151 places, 142/142 transitions.
Graph (complete) has 403 edges and 123 vertex of which 114 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
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 114 transition count 125
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 101 transition count 125
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 39 place count 89 transition count 86
Iterating global reduction 2 with 12 rules applied. Total rules applied 51 place count 89 transition count 86
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 89 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 86 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 83 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 83 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 66 place count 83 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 82 transition count 77
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 77 place count 77 transition count 72
Applied a total of 77 rules in 10 ms. Remains 77 /123 variables (removed 46) and now considering 72/142 (removed 70) transitions.
// Phase 1: matrix 72 rows 77 cols
[2023-03-11 03:00:08] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-11 03:00:08] [INFO ] Implicit Places using invariants in 56 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/151 places, 72/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 381 ms. Remains : 74/151 places, 72/142 transitions.
Computed a total of 51 stabilizing places and 54 stable transitions
Computed a total of 51 stabilizing places and 54 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1735 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 617 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3760 steps, run visited all 1 properties in 19 ms. (steps per millisecond=197 )
Probabilistic random walk after 3760 steps, saw 1331 distinct states, run finished after 19 ms. (steps per millisecond=197 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 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 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14586 reset in 107 ms.
Product exploration explored 100000 steps with 14399 reset in 101 ms.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 72/72 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 74 cols
[2023-03-11 03:00:09] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 03:00:09] [INFO ] Invariant cache hit.
[2023-03-11 03:00:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants and state equation in 79 ms returned [26, 29, 31]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 154 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/74 places, 72/72 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 71 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 68 transition count 69
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 2 with 23 rules applied. Total rules applied 29 place count 54 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 51 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 51 transition count 57
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 37 place count 50 transition count 56
Applied a total of 37 rules in 8 ms. Remains 50 /71 variables (removed 21) and now considering 56/72 (removed 16) transitions.
// Phase 1: matrix 56 rows 50 cols
[2023-03-11 03:00:09] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-11 03:00:09] [INFO ] Invariant cache hit.
[2023-03-11 03:00:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 03:00:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/74 places, 56/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 251 ms. Remains : 50/74 places, 56/72 transitions.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-12 finished in 2578 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 540 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 471 transition count 402
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 126 place count 471 transition count 290
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 375 place count 334 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 379 place count 330 transition count 286
Iterating global reduction 2 with 4 rules applied. Total rules applied 383 place count 330 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 383 place count 330 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 385 place count 329 transition count 285
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 678 place count 181 transition count 140
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 680 place count 180 transition count 143
Applied a total of 680 rules in 42 ms. Remains 180 /540 variables (removed 360) and now considering 143/472 (removed 329) transitions.
// Phase 1: matrix 143 rows 180 cols
[2023-03-11 03:00:10] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-11 03:00:10] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 123 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/540 places, 143/472 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 152/540 places, 143/472 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-14 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 s70 0) (EQ s38 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 22 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-14 finished in 215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(!p1&&F(p0)&&F(!p2)&&X(!p3)))))'
Found a Shortening insensitive property : BusinessProcesses-PT-18-LTLCardinality-11
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p3), (AND p2 (NOT p0)), (AND (NOT p0) p2)]
Support contains 5 out of 540 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 540/540 places, 472/472 transitions.
Graph (trivial) has 255 edges and 540 vertex of which 6 / 540 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 1205 edges and 535 vertex of which 534 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 533 transition count 402
Reduce places removed 62 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 471 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 470 transition count 401
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 128 place count 470 transition count 287
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 381 place count 331 transition count 287
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 384 place count 328 transition count 284
Iterating global reduction 3 with 3 rules applied. Total rules applied 387 place count 328 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 387 place count 328 transition count 283
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 389 place count 327 transition count 283
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 670 place count 185 transition count 144
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 672 place count 184 transition count 147
Applied a total of 672 rules in 58 ms. Remains 184 /540 variables (removed 356) and now considering 147/472 (removed 325) transitions.
// Phase 1: matrix 147 rows 184 cols
[2023-03-11 03:00:10] [INFO ] Computed 78 place invariants in 1 ms
[2023-03-11 03:00:10] [INFO ] Implicit Places using invariants in 128 ms returned [7, 8, 9, 10, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 130 ms to find 23 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 161/540 places, 147/472 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 192 ms. Remains : 161/540 places, 147/472 transitions.
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p3), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s48 0) (EQ s131 1)), p0:(NEQ s40 1), p2:(OR (EQ s32 0) (EQ s2 1)), p3:(OR (EQ s40 1) (EQ s48 0) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-11 finished in 509 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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 03:00:10] [INFO ] Flatten gal took : 31 ms
[2023-03-11 03:00:10] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 03:00:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 540 places, 472 transitions and 1512 arcs took 5 ms.
Total runtime 30724 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-18
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA BusinessProcesses-PT-18-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678503622772

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:250
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 BusinessProcesses-PT-18-LTLCardinality-12
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for BusinessProcesses-PT-18-LTLCardinality-12
lola: result : false
lola: markings : 5046
lola: fired transitions : 9869
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-18-LTLCardinality-04
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-18-LTLCardinality-12: LTL false LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 8/32 BusinessProcesses-PT-18-LTLCardinality-04 1083766 m, 216753 m/sec, 2572017 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 15/32 BusinessProcesses-PT-18-LTLCardinality-04 2216821 m, 226611 m/sec, 5646060 t fired, .

Time elapsed: 10 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-18-LTLCardinality-04
lola: result : true
lola: markings : 2553665
lola: fired transitions : 6592004
lola: time used : 11.000000
lola: memory pages used : 17
lola: LAUNCH task # 4 (type EXCL) for 3 BusinessProcesses-PT-18-LTLCardinality-11
lola: time limit : 3589 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for BusinessProcesses-PT-18-LTLCardinality-11
lola: result : false
lola: markings : 256
lola: fired transitions : 256
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-18-LTLCardinality-04: LTL true LTL model checker
BusinessProcesses-PT-18-LTLCardinality-11: LTL false LTL model checker
BusinessProcesses-PT-18-LTLCardinality-12: LTL false LTL model checker


Time elapsed: 11 secs. Pages in use: 17

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

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