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.r041-tajo-167813694900580.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 ltsminxred
Input is BusinessProcesses-PT-17, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900580
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:48 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.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 161K 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-17-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678647812994

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-17
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 19:03:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 19:03:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 19:03:34] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-12 19:03:34] [INFO ] Transformed 650 places.
[2023-03-12 19:03:34] [INFO ] Transformed 580 transitions.
[2023-03-12 19:03:34] [INFO ] Found NUPN structural information;
[2023-03-12 19:03:34] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 94 place count 552 transition count 485
Iterating global reduction 1 with 91 rules applied. Total rules applied 185 place count 552 transition count 485
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 229 place count 508 transition count 441
Iterating global reduction 1 with 44 rules applied. Total rules applied 273 place count 508 transition count 441
Applied a total of 273 rules in 130 ms. Remains 508 /646 variables (removed 138) and now considering 441/576 (removed 135) transitions.
// Phase 1: matrix 441 rows 508 cols
[2023-03-12 19:03:35] [INFO ] Computed 105 place invariants in 29 ms
[2023-03-12 19:03:35] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-12 19:03:35] [INFO ] Invariant cache hit.
[2023-03-12 19:03:35] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2023-03-12 19:03:35] [INFO ] Invariant cache hit.
[2023-03-12 19:03:36] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 508/646 places, 441/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1232 ms. Remains : 508/646 places, 441/576 transitions.
Support contains 36 out of 508 places after structural reductions.
[2023-03-12 19:03:36] [INFO ] Flatten gal took : 58 ms
[2023-03-12 19:03:36] [INFO ] Flatten gal took : 26 ms
[2023-03-12 19:03:36] [INFO ] Input system was already deterministic with 441 transitions.
Support contains 35 out of 508 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 66 resets, run finished after 473 ms. (steps per millisecond=21 ) properties (out of 22) seen :11
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-12 19:03:37] [INFO ] Invariant cache hit.
[2023-03-12 19:03:37] [INFO ] [Real]Absence check using 59 positive place invariants in 19 ms returned sat
[2023-03-12 19:03:37] [INFO ] [Real]Absence check using 59 positive and 46 generalized place invariants in 13 ms returned sat
[2023-03-12 19:03:38] [INFO ] After 230ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:7
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 5 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 10 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2023-03-12 19:03:38] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2023-03-12 19:03:39] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 0 ms to minimize.
[2023-03-12 19:03:39] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 856 ms
[2023-03-12 19:03:39] [INFO ] After 1189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 19:03:39] [INFO ] After 1443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-12 19:03:39] [INFO ] [Nat]Absence check using 59 positive place invariants in 14 ms returned sat
[2023-03-12 19:03:39] [INFO ] [Nat]Absence check using 59 positive and 46 generalized place invariants in 11 ms returned sat
[2023-03-12 19:03:39] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-12 19:03:39] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2023-03-12 19:03:39] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 733 ms
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 0 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2023-03-12 19:03:40] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 0 ms to minimize.
[2023-03-12 19:03:41] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 0 ms to minimize.
[2023-03-12 19:03:41] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 0 ms to minimize.
[2023-03-12 19:03:41] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 0 ms to minimize.
[2023-03-12 19:03:41] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 0 ms to minimize.
[2023-03-12 19:03:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 895 ms
[2023-03-12 19:03:41] [INFO ] After 2214ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-12 19:03:41] [INFO ] After 2607ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 88 ms.
Support contains 5 out of 508 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 508/508 places, 441/441 transitions.
Graph (trivial) has 230 edges and 508 vertex of which 6 / 508 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 502 transition count 383
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 452 transition count 383
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 102 place count 452 transition count 277
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 231 rules applied. Total rules applied 333 place count 327 transition count 277
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 337 place count 323 transition count 273
Iterating global reduction 2 with 4 rules applied. Total rules applied 341 place count 323 transition count 273
Performed 136 Post agglomeration using F-continuation condition.Transition count delta: 136
Deduced a syphon composed of 136 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 617 place count 183 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 619 place count 182 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 621 place count 182 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 623 place count 180 transition count 139
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 624 place count 180 transition count 139
Applied a total of 624 rules in 95 ms. Remains 180 /508 variables (removed 328) and now considering 139/441 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 180/508 places, 139/441 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 134 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 139 rows 180 cols
[2023-03-12 19:03:42] [INFO ] Computed 82 place invariants in 6 ms
[2023-03-12 19:03:42] [INFO ] [Real]Absence check using 60 positive place invariants in 7 ms returned sat
[2023-03-12 19:03:42] [INFO ] [Real]Absence check using 60 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-12 19:03:42] [INFO ] After 47ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 19:03:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 19:03:42] [INFO ] After 10ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:03:42] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 19:03:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 6 ms returned sat
[2023-03-12 19:03:42] [INFO ] [Nat]Absence check using 60 positive and 22 generalized place invariants in 4 ms returned sat
[2023-03-12 19:03:42] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 19:03:42] [INFO ] After 8ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 19:03:42] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-12 19:03:42] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 212 stabilizing places and 184 stable transitions
Graph (complete) has 1148 edges and 508 vertex of which 507 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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 U (X(p1) U ((!p0&&X(p1))||X(G(p1))))))))'
Support contains 2 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 503 transition count 436
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 503 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 502 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 502 transition count 435
Applied a total of 12 rules in 28 ms. Remains 502 /508 variables (removed 6) and now considering 435/441 (removed 6) transitions.
// Phase 1: matrix 435 rows 502 cols
[2023-03-12 19:03:42] [INFO ] Computed 105 place invariants in 5 ms
[2023-03-12 19:03:42] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-12 19:03:42] [INFO ] Invariant cache hit.
[2023-03-12 19:03:43] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2023-03-12 19:03:43] [INFO ] Invariant cache hit.
[2023-03-12 19:03:43] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/508 places, 435/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 936 ms. Remains : 502/508 places, 435/441 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s64 1), p1:(EQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 612 steps with 9 reset in 8 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-00 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 2 out of 508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Graph (trivial) has 233 edges and 508 vertex of which 6 / 508 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 1142 edges and 503 vertex of which 502 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 501 transition count 383
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 451 transition count 383
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 102 place count 451 transition count 274
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 340 place count 322 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 345 place count 317 transition count 269
Iterating global reduction 2 with 5 rules applied. Total rules applied 350 place count 317 transition count 269
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 350 place count 317 transition count 268
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 352 place count 316 transition count 268
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 619 place count 180 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 621 place count 179 transition count 141
Applied a total of 621 rules in 61 ms. Remains 179 /508 variables (removed 329) and now considering 141/441 (removed 300) transitions.
// Phase 1: matrix 141 rows 179 cols
[2023-03-12 19:03:43] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-12 19:03:43] [INFO ] Implicit Places using invariants in 116 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 44, 45, 46, 51, 52, 53, 54, 55, 59, 60]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 119 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 158/508 places, 141/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 158/508 places, 141/441 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s38 1), p1:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Graph (trivial) has 232 edges and 508 vertex of which 4 / 508 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1145 edges and 505 vertex of which 504 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 503 transition count 385
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 452 transition count 385
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 104 place count 452 transition count 276
Deduced a syphon composed of 109 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 342 place count 323 transition count 276
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 348 place count 317 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 354 place count 317 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 354 place count 317 transition count 269
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 356 place count 316 transition count 269
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 627 place count 178 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 629 place count 177 transition count 140
Applied a total of 629 rules in 46 ms. Remains 177 /508 variables (removed 331) and now considering 140/441 (removed 301) transitions.
// Phase 1: matrix 140 rows 177 cols
[2023-03-12 19:03:43] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-12 19:03:44] [INFO ] Implicit Places using invariants in 112 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 113 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/508 places, 140/441 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 155/508 places, 140/441 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-02 finished in 202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G((p1&&X((p1 U (p2||G(p1))))))))))'
Support contains 2 out of 508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Graph (trivial) has 233 edges and 508 vertex of which 6 / 508 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 1142 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 501 transition count 382
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 450 transition count 382
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 104 place count 450 transition count 275
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 338 place count 323 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 318 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 318 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 348 place count 318 transition count 269
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 350 place count 317 transition count 269
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 622 place count 179 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 624 place count 178 transition count 139
Applied a total of 624 rules in 40 ms. Remains 178 /508 variables (removed 330) and now considering 139/441 (removed 302) transitions.
// Phase 1: matrix 139 rows 178 cols
[2023-03-12 19:03:44] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-12 19:03:44] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 43, 44, 45, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 123 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/508 places, 139/441 transitions.
Applied a total of 0 rules in 5 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 169 ms. Remains : 155/508 places, 139/441 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=p1, acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s109 0), p1:(NEQ s35 1), p2:(NEQ s109 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 29419 reset in 340 ms.
Product exploration explored 100000 steps with 29416 reset in 288 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Detected a total of 32/155 stabilizing places and 24/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 500 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2499 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 746 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 768 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 771 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 758 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 139 rows 155 cols
[2023-03-12 19:03:45] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-12 19:03:46] [INFO ] [Real]Absence check using 37 positive place invariants in 5 ms returned sat
[2023-03-12 19:03:46] [INFO ] [Real]Absence check using 37 positive and 21 generalized place invariants in 7 ms returned sat
[2023-03-12 19:03:46] [INFO ] After 66ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:2
[2023-03-12 19:03:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:03:46] [INFO ] After 11ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 19:03:46] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-12 19:03:46] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-12 19:03:46] [INFO ] [Nat]Absence check using 37 positive and 21 generalized place invariants in 5 ms returned sat
[2023-03-12 19:03:46] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-12 19:03:46] [INFO ] After 26ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-12 19:03:46] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-12 19:03:46] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 2 ms.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 139/139 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 155 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 155 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 153 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 153 transition count 136
Applied a total of 6 rules in 13 ms. Remains 153 /155 variables (removed 2) and now considering 136/139 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 153/155 places, 136/139 transitions.
Incomplete random walk after 10000 steps, including 271 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Probably explored full state space saw : 5697 states, properties seen :0
Probabilistic random walk after 18555 steps, saw 5697 distinct states, run finished after 91 ms. (steps per millisecond=203 ) properties seen :0
Explored full state space saw : 5697 states, properties seen :0
Exhaustive walk after 18555 steps, saw 5697 distinct states, run finished after 80 ms. (steps per millisecond=231 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 789 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2023-03-12 19:03:47] [INFO ] Invariant cache hit.
[2023-03-12 19:03:47] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-12 19:03:47] [INFO ] Invariant cache hit.
[2023-03-12 19:03:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants and state equation in 322 ms returned [3, 25, 27, 29, 37, 39, 41, 43, 45, 52, 54, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 443 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 123/155 places, 139/139 transitions.
Graph (complete) has 398 edges and 123 vertex of which 114 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 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 122
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 122
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 38 place count 90 transition count 83
Iterating global reduction 2 with 11 rules applied. Total rules applied 49 place count 90 transition count 83
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 90 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 89 transition count 82
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 53 place count 87 transition count 80
Iterating global reduction 4 with 2 rules applied. Total rules applied 55 place count 87 transition count 80
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 71 place count 78 transition count 73
Applied a total of 71 rules in 17 ms. Remains 78 /123 variables (removed 45) and now considering 73/139 (removed 66) transitions.
// Phase 1: matrix 73 rows 78 cols
[2023-03-12 19:03:48] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants in 59 ms returned [3, 4, 5, 10, 75]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/155 places, 73/139 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 73 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 71 transition count 71
Applied a total of 4 rules in 5 ms. Remains 71 /73 variables (removed 2) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 71 cols
[2023-03-12 19:03:48] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-12 19:03:48] [INFO ] Invariant cache hit.
[2023-03-12 19:03:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [14, 20, 22]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 145 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 68/155 places, 71/139 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 68 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 65 transition count 68
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 63 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 63 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 63 transition count 64
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 34 place count 49 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 46 transition count 52
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 46 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 46 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 45 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 45 transition count 48
Applied a total of 45 rules in 16 ms. Remains 45 /68 variables (removed 23) and now considering 48/71 (removed 23) transitions.
// Phase 1: matrix 48 rows 45 cols
[2023-03-12 19:03:48] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-12 19:03:48] [INFO ] Invariant cache hit.
[2023-03-12 19:03:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-12 19:03:48] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 45/155 places, 48/139 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 816 ms. Remains : 45/155 places, 48/139 transitions.
Computed a total of 12 stabilizing places and 14 stable transitions
Computed a total of 12 stabilizing places and 14 stable transitions
Detected a total of 12/45 stabilizing places and 14/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2552 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 763 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 52 steps, run visited all 1 properties in 4 ms. (steps per millisecond=13 )
Probabilistic random walk after 52 steps, saw 34 distinct states, run finished after 5 ms. (steps per millisecond=10 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 7 factoid took 308 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 54 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 26435 steps with 5829 reset in 41 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 5206 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((G(F(p1))||p0))))'
Support contains 4 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 502 transition count 435
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 501 transition count 434
Applied a total of 14 rules in 78 ms. Remains 501 /508 variables (removed 7) and now considering 434/441 (removed 7) transitions.
// Phase 1: matrix 434 rows 501 cols
[2023-03-12 19:03:49] [INFO ] Computed 105 place invariants in 4 ms
[2023-03-12 19:03:49] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-12 19:03:49] [INFO ] Invariant cache hit.
[2023-03-12 19:03:50] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-12 19:03:50] [INFO ] Invariant cache hit.
[2023-03-12 19:03:50] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/508 places, 434/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1109 ms. Remains : 501/508 places, 434/441 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s60 0) (EQ s297 0) (EQ s403 0)), p1:(EQ s246 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-04 finished in 2008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 508 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Graph (trivial) has 233 edges and 508 vertex of which 6 / 508 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 1142 edges and 503 vertex of which 502 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 501 transition count 383
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 451 transition count 383
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 108 Pre rules applied. Total rules applied 102 place count 451 transition count 275
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 338 place count 323 transition count 275
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 343 place count 318 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 348 place count 318 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 348 place count 318 transition count 269
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 350 place count 317 transition count 269
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 134
Deduced a syphon composed of 134 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 623 place count 178 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 625 place count 177 transition count 139
Applied a total of 625 rules in 47 ms. Remains 177 /508 variables (removed 331) and now considering 139/441 (removed 302) transitions.
// Phase 1: matrix 139 rows 177 cols
[2023-03-12 19:03:51] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-12 19:03:51] [INFO ] Implicit Places using invariants in 206 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 209 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/508 places, 139/441 transitions.
Applied a total of 0 rules in 4 ms. Remains 155 /155 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 155/508 places, 139/441 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-05 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X((X(p1)&&G(p2))) U (!p3&&X((X(p1)&&G(p2))))))||p0)))'
Support contains 5 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 502 transition count 435
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 501 transition count 434
Applied a total of 14 rules in 44 ms. Remains 501 /508 variables (removed 7) and now considering 434/441 (removed 7) transitions.
// Phase 1: matrix 434 rows 501 cols
[2023-03-12 19:03:51] [INFO ] Computed 105 place invariants in 4 ms
[2023-03-12 19:03:51] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-12 19:03:51] [INFO ] Invariant cache hit.
[2023-03-12 19:03:52] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-12 19:03:52] [INFO ] Invariant cache hit.
[2023-03-12 19:03:52] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/508 places, 434/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 501/508 places, 434/441 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), (OR (NOT p1) (NOT p2) p3), (OR (NOT p2) (NOT p1)), true, (AND p2 (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p3, acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (NEQ s75 1) (NEQ s305 1) (NEQ s421 1)), p3:(AND (EQ s75 1) (EQ s305 1) (EQ s421 1)), p2:(NEQ s177 1), p1:(EQ s235 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 288 ms.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1135 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Detected a total of 206/501 stabilizing places and 178/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p0), (X (X (NOT p3))), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 66 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-17-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-06 finished in 1925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)&&p0)))))'
Support contains 6 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 502 transition count 435
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 501 transition count 434
Applied a total of 14 rules in 30 ms. Remains 501 /508 variables (removed 7) and now considering 434/441 (removed 7) transitions.
[2023-03-12 19:03:53] [INFO ] Invariant cache hit.
[2023-03-12 19:03:53] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-12 19:03:53] [INFO ] Invariant cache hit.
[2023-03-12 19:03:54] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2023-03-12 19:03:54] [INFO ] Invariant cache hit.
[2023-03-12 19:03:54] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/508 places, 434/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 501/508 places, 434/441 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s220 1) (EQ s385 1) (EQ s458 1)), p1:(AND (EQ s52 1) (EQ s296 1) (EQ s462 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 1096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&G(p1))))'
Support contains 6 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 502 transition count 435
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 502 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 501 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 501 transition count 434
Applied a total of 14 rules in 33 ms. Remains 501 /508 variables (removed 7) and now considering 434/441 (removed 7) transitions.
[2023-03-12 19:03:54] [INFO ] Invariant cache hit.
[2023-03-12 19:03:54] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-12 19:03:54] [INFO ] Invariant cache hit.
[2023-03-12 19:03:55] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-12 19:03:55] [INFO ] Invariant cache hit.
[2023-03-12 19:03:55] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/508 places, 434/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 938 ms. Remains : 501/508 places, 434/441 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s190 0) (EQ s365 0) (EQ s448 0)), p0:(OR (AND (EQ s43 1) (EQ s274 1) (EQ s412 1)) (EQ s190 0) (EQ s365 0) (EQ s448 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19865 steps with 130 reset in 39 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 1126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 508 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 508/508 places, 441/441 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 503 transition count 436
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 503 transition count 436
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 502 transition count 435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 502 transition count 435
Applied a total of 12 rules in 28 ms. Remains 502 /508 variables (removed 6) and now considering 435/441 (removed 6) transitions.
// Phase 1: matrix 435 rows 502 cols
[2023-03-12 19:03:55] [INFO ] Computed 105 place invariants in 4 ms
[2023-03-12 19:03:56] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-12 19:03:56] [INFO ] Invariant cache hit.
[2023-03-12 19:03:56] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-12 19:03:56] [INFO ] Invariant cache hit.
[2023-03-12 19:03:56] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 502/508 places, 435/441 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 882 ms. Remains : 502/508 places, 435/441 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s448 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-14 finished in 969 ms.
All properties solved by simple procedures.
Total runtime 22289 ms.
ITS solved all properties within timeout

BK_STOP 1678647836947

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-17"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-17, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694900580"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;