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.r037-tajo-167813690400484.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 itstools
Input is BusinessProcesses-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 85K 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-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678360204784

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:10:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:10:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:10:06] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 11:10:06] [INFO ] Transformed 368 places.
[2023-03-09 11:10:06] [INFO ] Transformed 319 transitions.
[2023-03-09 11:10:06] [INFO ] Found NUPN structural information;
[2023-03-09 11:10:06] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 121 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 1 formulas.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 54 place count 313 transition count 266
Iterating global reduction 1 with 52 rules applied. Total rules applied 106 place count 313 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 313 transition count 265
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 134 place count 286 transition count 238
Iterating global reduction 2 with 27 rules applied. Total rules applied 161 place count 286 transition count 238
Applied a total of 161 rules in 59 ms. Remains 286 /367 variables (removed 81) and now considering 238/318 (removed 80) transitions.
// Phase 1: matrix 238 rows 286 cols
[2023-03-09 11:10:06] [INFO ] Computed 55 place invariants in 22 ms
[2023-03-09 11:10:07] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-09 11:10:07] [INFO ] Invariant cache hit.
[2023-03-09 11:10:07] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2023-03-09 11:10:07] [INFO ] Invariant cache hit.
[2023-03-09 11:10:07] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 286/367 places, 238/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 286/367 places, 238/318 transitions.
Support contains 42 out of 286 places after structural reductions.
[2023-03-09 11:10:07] [INFO ] Flatten gal took : 37 ms
[2023-03-09 11:10:07] [INFO ] Flatten gal took : 15 ms
[2023-03-09 11:10:07] [INFO ] Input system was already deterministic with 238 transitions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 344 ms. (steps per millisecond=29 ) properties (out of 35) seen :22
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 11:10:08] [INFO ] Invariant cache hit.
[2023-03-09 11:10:08] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2023-03-09 11:10:08] [INFO ] After 73ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2023-03-09 11:10:08] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 5 ms to minimize.
[2023-03-09 11:10:08] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 3 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-09 11:10:09] [INFO ] After 285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 11:10:09] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 11:10:09] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-09 11:10:09] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 275 ms
[2023-03-09 11:10:09] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2023-03-09 11:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 11:10:09] [INFO ] After 578ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-09 11:10:09] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 6 properties in 21 ms.
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (trivial) has 151 edges and 286 vertex of which 7 / 286 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 593 edges and 280 vertex of which 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 279 transition count 190
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 241 transition count 190
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 78 place count 241 transition count 135
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 201 place count 173 transition count 135
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 212 place count 162 transition count 124
Iterating global reduction 2 with 11 rules applied. Total rules applied 223 place count 162 transition count 124
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 381 place count 82 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 81 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 383 place count 80 transition count 45
Applied a total of 383 rules in 40 ms. Remains 80 /286 variables (removed 206) and now considering 45/238 (removed 193) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 80/286 places, 45/238 transitions.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 279 stabilizing places and 229 stable transitions
Graph (complete) has 604 edges and 286 vertex of which 285 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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)&&F(p1)&&F((p2||X(X(F(p3)))))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 273 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 273 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 268 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 268 transition count 220
Applied a total of 36 rules in 20 ms. Remains 268 /286 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:10] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:10] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 11:10:10] [INFO ] Invariant cache hit.
[2023-03-09 11:10:10] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-09 11:10:10] [INFO ] Invariant cache hit.
[2023-03-09 11:10:10] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/286 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 268/286 places, 220/238 transitions.
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s94 0), p1:(EQ s190 0), p2:(EQ s20 1), p3:(EQ s94 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 860 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(p0)||(p1&&F(G(p2)))))))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 273 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 273 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 268 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 268 transition count 220
Applied a total of 36 rules in 16 ms. Remains 268 /286 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:11] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:11] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-09 11:10:11] [INFO ] Invariant cache hit.
[2023-03-09 11:10:11] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-09 11:10:11] [INFO ] Invariant cache hit.
[2023-03-09 11:10:11] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/286 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 268/286 places, 220/238 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(EQ s47 1), p0:(EQ s3 1), p2:(EQ s3 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 679 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||G(p2)))&&p0)))'
Support contains 6 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 273 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 273 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 268 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 268 transition count 220
Applied a total of 36 rules in 13 ms. Remains 268 /286 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:11] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-09 11:10:11] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-09 11:10:11] [INFO ] Invariant cache hit.
[2023-03-09 11:10:12] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 11:10:12] [INFO ] Invariant cache hit.
[2023-03-09 11:10:12] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/286 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 268/286 places, 220/238 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(AND (EQ s25 1) (EQ s140 1) (EQ s267 1)), p2:(OR (EQ s19 0) (EQ s152 0) (EQ s267 0)), p1:(AND (EQ s19 1) (EQ s152 1) (EQ s267 1) (EQ s223 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1 U (G(p1)||(p1&&G(p2))))))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 273 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 273 transition count 225
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 269 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 269 transition count 221
Applied a total of 34 rules in 13 ms. Remains 269 /286 variables (removed 17) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 269 cols
[2023-03-09 11:10:12] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-09 11:10:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 11:10:12] [INFO ] Invariant cache hit.
[2023-03-09 11:10:12] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-09 11:10:12] [INFO ] Invariant cache hit.
[2023-03-09 11:10:12] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/286 places, 221/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 269/286 places, 221/238 transitions.
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s43 0), p1:(OR (EQ s43 1) (EQ s49 1)), p2:(NEQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 118 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 1350 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 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (trivial) has 150 edges and 286 vertex of which 7 / 286 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 596 edges and 280 vertex of which 279 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 278 transition count 192
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 241 transition count 192
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 76 place count 241 transition count 137
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 199 place count 173 transition count 137
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 210 place count 162 transition count 126
Iterating global reduction 2 with 11 rules applied. Total rules applied 221 place count 162 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 221 place count 162 transition count 125
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 224 place count 160 transition count 125
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 378 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 380 place count 80 transition count 48
Applied a total of 380 rules in 32 ms. Remains 80 /286 variables (removed 206) and now considering 48/238 (removed 190) transitions.
// Phase 1: matrix 48 rows 80 cols
[2023-03-09 11:10:13] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-09 11:10:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 11:10:13] [INFO ] Invariant cache hit.
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 134 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/286 places, 48/238 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 34 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 29 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 29 transition count 35
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 29 place count 29 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 25 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 25 transition count 31
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 4 with 10 rules applied. Total rules applied 44 place count 20 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 20 transition count 25
Applied a total of 45 rules in 10 ms. Remains 20 /42 variables (removed 22) and now considering 25/48 (removed 23) transitions.
// Phase 1: matrix 25 rows 20 cols
[2023-03-09 11:10:14] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 11:10:14] [INFO ] Invariant cache hit.
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/286 places, 25/238 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 20/286 places, 25/238 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s17 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 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-04 finished in 276 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(G((p0&&F(p1)))))))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 274 transition count 226
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 274 transition count 226
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 269 transition count 221
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 269 transition count 221
Applied a total of 34 rules in 14 ms. Remains 269 /286 variables (removed 17) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 269 cols
[2023-03-09 11:10:14] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 11:10:14] [INFO ] Invariant cache hit.
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-09 11:10:14] [INFO ] Invariant cache hit.
[2023-03-09 11:10:14] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 269/286 places, 221/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 269/286 places, 221/238 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s249 1), p1:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-05 finished in 714 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (trivial) has 150 edges and 286 vertex of which 7 / 286 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 596 edges and 280 vertex of which 279 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 278 transition count 191
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 240 transition count 191
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 78 place count 240 transition count 137
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 198 place count 174 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 210 place count 162 transition count 125
Iterating global reduction 2 with 12 rules applied. Total rules applied 222 place count 162 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 222 place count 162 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 225 place count 160 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 375 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 82 transition count 49
Applied a total of 377 rules in 37 ms. Remains 82 /286 variables (removed 204) and now considering 49/238 (removed 189) transitions.
// Phase 1: matrix 49 rows 82 cols
[2023-03-09 11:10:14] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 11:10:14] [INFO ] Implicit Places using invariants in 51 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/286 places, 49/238 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 81/286 places, 49/238 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s28 1), p1:(EQ s74 1)], nbAcceptance=2, 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-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-06 finished in 145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(p1) U (p0&&X(p2))))))'
Support contains 3 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 274 transition count 226
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 274 transition count 226
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 270 transition count 222
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 270 transition count 222
Applied a total of 32 rules in 18 ms. Remains 270 /286 variables (removed 16) and now considering 222/238 (removed 16) transitions.
// Phase 1: matrix 222 rows 270 cols
[2023-03-09 11:10:15] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-09 11:10:15] [INFO ] Invariant cache hit.
[2023-03-09 11:10:15] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-09 11:10:15] [INFO ] Invariant cache hit.
[2023-03-09 11:10:15] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 270/286 places, 222/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 270/286 places, 222/238 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p1), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s135 1), p1:(NEQ s142 1), p2:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 272 transition count 224
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 268 transition count 220
Applied a total of 36 rules in 12 ms. Remains 268 /286 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:15] [INFO ] Computed 55 place invariants in 3 ms
[2023-03-09 11:10:15] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-09 11:10:15] [INFO ] Invariant cache hit.
[2023-03-09 11:10:16] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-09 11:10:16] [INFO ] Invariant cache hit.
[2023-03-09 11:10:16] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/286 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 493 ms. Remains : 268/286 places, 220/238 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s241 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-08 finished in 593 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&&F(p2)))))))'
Support contains 5 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (complete) has 604 edges and 286 vertex of which 285 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 284 transition count 202
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 250 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 248 transition count 200
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 73 place count 248 transition count 141
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 204 place count 176 transition count 141
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 217 place count 163 transition count 128
Iterating global reduction 3 with 13 rules applied. Total rules applied 230 place count 163 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 230 place count 163 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 233 place count 161 transition count 127
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 381 place count 86 transition count 54
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 86 transition count 54
Applied a total of 382 rules in 37 ms. Remains 86 /286 variables (removed 200) and now considering 54/238 (removed 184) transitions.
// Phase 1: matrix 54 rows 86 cols
[2023-03-09 11:10:16] [INFO ] Computed 39 place invariants in 0 ms
[2023-03-09 11:10:16] [INFO ] Implicit Places using invariants in 61 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 65 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/286 places, 54/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 85/286 places, 54/238 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s20 0) (AND (EQ s16 1) (EQ s30 1) (EQ s84 1))), p1:(EQ s66 1), p2:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 251 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (trivial) has 151 edges and 286 vertex of which 7 / 286 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 596 edges and 280 vertex of which 279 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 278 transition count 191
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 240 transition count 191
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 78 place count 240 transition count 137
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 198 place count 174 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 210 place count 162 transition count 125
Iterating global reduction 2 with 12 rules applied. Total rules applied 222 place count 162 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 222 place count 162 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 225 place count 160 transition count 124
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 379 place count 82 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 380 place count 81 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 381 place count 80 transition count 47
Applied a total of 381 rules in 46 ms. Remains 80 /286 variables (removed 206) and now considering 47/238 (removed 191) transitions.
// Phase 1: matrix 47 rows 80 cols
[2023-03-09 11:10:16] [INFO ] Computed 39 place invariants in 1 ms
[2023-03-09 11:10:16] [INFO ] Implicit Places using invariants in 43 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/286 places, 47/238 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 79/286 places, 47/238 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-10 finished in 233 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(p1))&&p0)))'
Support contains 4 out of 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 273 transition count 225
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 273 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 268 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 268 transition count 220
Applied a total of 36 rules in 15 ms. Remains 268 /286 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 268 cols
[2023-03-09 11:10:16] [INFO ] Computed 55 place invariants in 1 ms
[2023-03-09 11:10:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-09 11:10:16] [INFO ] Invariant cache hit.
[2023-03-09 11:10:17] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-09 11:10:17] [INFO ] Invariant cache hit.
[2023-03-09 11:10:17] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/286 places, 220/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 511 ms. Remains : 268/286 places, 220/238 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s78 1) (EQ s221 1) (EQ s255 1)), p1:(EQ s252 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-11 finished in 674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 286 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Graph (trivial) has 149 edges and 286 vertex of which 7 / 286 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 596 edges and 280 vertex of which 279 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 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 278 transition count 192
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 76 place count 241 transition count 192
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 76 place count 241 transition count 138
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 196 place count 175 transition count 138
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 207 place count 164 transition count 127
Iterating global reduction 2 with 11 rules applied. Total rules applied 218 place count 164 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 218 place count 164 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 221 place count 162 transition count 126
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 375 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 377 place count 82 transition count 49
Applied a total of 377 rules in 34 ms. Remains 82 /286 variables (removed 204) and now considering 49/238 (removed 189) transitions.
// Phase 1: matrix 49 rows 82 cols
[2023-03-09 11:10:17] [INFO ] Computed 39 place invariants in 0 ms
[2023-03-09 11:10:17] [INFO ] Implicit Places using invariants in 64 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/286 places, 49/238 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 81/286 places, 49/238 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s9 1), p0:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-14 finished in 218 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 286 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 286/286 places, 238/238 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 272 transition count 224
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 272 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 267 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 267 transition count 219
Applied a total of 38 rules in 9 ms. Remains 267 /286 variables (removed 19) and now considering 219/238 (removed 19) transitions.
// Phase 1: matrix 219 rows 267 cols
[2023-03-09 11:10:17] [INFO ] Computed 55 place invariants in 2 ms
[2023-03-09 11:10:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 11:10:17] [INFO ] Invariant cache hit.
[2023-03-09 11:10:18] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-09 11:10:18] [INFO ] Invariant cache hit.
[2023-03-09 11:10:18] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/286 places, 219/238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 267/286 places, 219/238 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15 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 s105 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-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 596 ms.
All properties solved by simple procedures.
Total runtime 11932 ms.

BK_STOP 1678360218567

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-05, 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 r037-tajo-167813690400484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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