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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678364450252

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-18
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 12:20:51] [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 12:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:20:52] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-09 12:20:52] [INFO ] Transformed 717 places.
[2023-03-09 12:20:52] [INFO ] Transformed 642 transitions.
[2023-03-09 12:20:52] [INFO ] Found NUPN structural information;
[2023-03-09 12:20:52] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 139 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 3 formulas.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 102 place count 600 transition count 533
Iterating global reduction 1 with 94 rules applied. Total rules applied 196 place count 600 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 197 place count 600 transition count 532
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 245 place count 552 transition count 484
Iterating global reduction 2 with 48 rules applied. Total rules applied 293 place count 552 transition count 484
Applied a total of 293 rules in 129 ms. Remains 552 /702 variables (removed 150) and now considering 484/627 (removed 143) transitions.
// Phase 1: matrix 484 rows 552 cols
[2023-03-09 12:20:52] [INFO ] Computed 106 place invariants in 28 ms
[2023-03-09 12:20:53] [INFO ] Implicit Places using invariants in 719 ms returned []
[2023-03-09 12:20:53] [INFO ] Invariant cache hit.
[2023-03-09 12:20:53] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-09 12:20:53] [INFO ] Invariant cache hit.
[2023-03-09 12:20:53] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 552/702 places, 484/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1692 ms. Remains : 552/702 places, 484/627 transitions.
Support contains 39 out of 552 places after structural reductions.
[2023-03-09 12:20:54] [INFO ] Flatten gal took : 74 ms
[2023-03-09 12:20:54] [INFO ] Flatten gal took : 35 ms
[2023-03-09 12:20:54] [INFO ] Input system was already deterministic with 484 transitions.
Support contains 38 out of 552 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 502 ms. (steps per millisecond=19 ) properties (out of 25) seen :13
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 12:20:55] [INFO ] Invariant cache hit.
[2023-03-09 12:20:55] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 12:20:55] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2023-03-09 12:20:55] [INFO ] [Nat]Absence check using 65 positive and 41 generalized place invariants in 13 ms returned sat
[2023-03-09 12:20:56] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 5 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-03-09 12:20:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2023-03-09 12:20:57] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-09 12:20:57] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2023-03-09 12:20:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1098 ms
[2023-03-09 12:20:57] [INFO ] Deduced a trap composed of 102 places in 199 ms of which 1 ms to minimize.
[2023-03-09 12:20:57] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 0 ms to minimize.
[2023-03-09 12:20:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2023-03-09 12:20:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2023-03-09 12:20:58] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2023-03-09 12:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-03-09 12:20:58] [INFO ] After 2759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 270 ms.
[2023-03-09 12:20:58] [INFO ] After 3256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 123 ms.
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 270 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1218 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 546 transition count 407
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 477 transition count 407
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 140 place count 477 transition count 291
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 397 place count 336 transition count 291
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 408 place count 325 transition count 280
Iterating global reduction 2 with 11 rules applied. Total rules applied 419 place count 325 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 420 place count 324 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 324 transition count 279
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 710 place count 178 transition count 136
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 712 place count 177 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 713 place count 177 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 176 transition count 138
Applied a total of 714 rules in 106 ms. Remains 176 /552 variables (removed 376) and now considering 138/484 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 176/552 places, 138/484 transitions.
Finished random walk after 247 steps, including 10 resets, run visited all 1 properties in 3 ms. (steps per millisecond=82 )
Computed a total of 496 stabilizing places and 438 stable transitions
Graph (complete) has 1232 edges and 552 vertex of which 551 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 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 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 267 edges and 552 vertex of which 6 / 552 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 1225 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 545 transition count 408
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 477 transition count 408
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 138 place count 477 transition count 293
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 393 place count 337 transition count 293
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 402 place count 328 transition count 284
Iterating global reduction 2 with 9 rules applied. Total rules applied 411 place count 328 transition count 284
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 289 rules applied. Total rules applied 700 place count 182 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 702 place count 181 transition count 144
Applied a total of 702 rules in 58 ms. Remains 181 /552 variables (removed 371) and now considering 144/484 (removed 340) transitions.
// Phase 1: matrix 144 rows 181 cols
[2023-03-09 12:20:59] [INFO ] Computed 78 place invariants in 3 ms
[2023-03-09 12:20:59] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 6, 7, 8, 9, 10, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 53, 54, 55]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 147 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/552 places, 144/484 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 155/552 places, 144/484 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01 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:(OR (EQ s29 0) (EQ s2 0)), p1:(EQ s117 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13629 reset in 301 ms.
Product exploration explored 100000 steps with 13547 reset in 236 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Computed a total of 136 stabilizing places and 129 stable transitions
Detected a total of 136/155 stabilizing places and 129/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 449 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1616 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 553 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 544 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 584 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 575 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Finished probabilistic random walk after 19211 steps, run visited all 4 properties in 100 ms. (steps per millisecond=192 )
Probabilistic random walk after 19211 steps, saw 6067 distinct states, run finished after 101 ms. (steps per millisecond=190 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 459 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 144/144 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 155 cols
[2023-03-09 12:21:01] [INFO ] Computed 52 place invariants in 4 ms
[2023-03-09 12:21:02] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-09 12:21:02] [INFO ] Invariant cache hit.
[2023-03-09 12:21:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 12:21:02] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [6, 28, 31, 32, 34, 36, 38, 39, 55, 57, 61, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 412 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/155 places, 144/144 transitions.
Graph (complete) has 411 edges and 126 vertex of which 117 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 117 transition count 127
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 104 transition count 127
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 91 transition count 86
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 91 transition count 86
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 91 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 88 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 85 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 85 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 85 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 76 place count 80 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 80 transition count 74
Applied a total of 77 rules in 35 ms. Remains 80 /126 variables (removed 46) and now considering 74/144 (removed 70) transitions.
// Phase 1: matrix 74 rows 80 cols
[2023-03-09 12:21:02] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-09 12:21:02] [INFO ] Implicit Places using invariants in 64 ms returned [6, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/155 places, 74/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 526 ms. Remains : 77/155 places, 74/144 transitions.
Computed a total of 58 stabilizing places and 59 stable transitions
Graph (complete) has 236 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 58 stabilizing places and 59 stable transitions
Detected a total of 58/77 stabilizing places and 59/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 485 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1726 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 601 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 575 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 598 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 561 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Finished probabilistic random walk after 11524 steps, run visited all 4 properties in 52 ms. (steps per millisecond=221 )
Probabilistic random walk after 11524 steps, saw 3862 distinct states, run finished after 52 ms. (steps per millisecond=221 ) properties seen :4
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 11 factoid took 400 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14140 reset in 174 ms.
Product exploration explored 100000 steps with 14209 reset in 204 ms.
Built C files in :
/tmp/ltsmin7222404261053402471
[2023-03-09 12:21:04] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2023-03-09 12:21:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:21:04] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2023-03-09 12:21:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:21:04] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2023-03-09 12:21:04] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 12:21:04] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7222404261053402471
Running compilation step : cd /tmp/ltsmin7222404261053402471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 321 ms.
Running link step : cd /tmp/ltsmin7222404261053402471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin7222404261053402471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9222434316056695194.hoa' '--buchi-type=spotba'
LTSmin run took 4086 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 9747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1))))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 540 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 540 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Applied a total of 38 rules in 105 ms. Remains 533 /552 variables (removed 19) and now considering 465/484 (removed 19) transitions.
// Phase 1: matrix 465 rows 533 cols
[2023-03-09 12:21:09] [INFO ] Computed 106 place invariants in 15 ms
[2023-03-09 12:21:09] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-09 12:21:09] [INFO ] Invariant cache hit.
[2023-03-09 12:21:09] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 818 ms to find 0 implicit places.
[2023-03-09 12:21:09] [INFO ] Invariant cache hit.
[2023-03-09 12:21:10] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/552 places, 465/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1172 ms. Remains : 533/552 places, 465/484 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s213 1), p1:(OR (EQ s252 1) (EQ s487 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3972 reset in 200 ms.
Stack based approach found an accepted trace after 261 steps with 10 reset with depth 7 and stack size 7 in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-02 finished in 1600 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((F(p1)&&F((!p0 U (p2||G(!p0)))))))))'
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 267 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1225 edges and 547 vertex of which 546 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 545 transition count 407
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 476 transition count 407
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 140 place count 476 transition count 294
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 391 place count 338 transition count 294
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 401 place count 328 transition count 284
Iterating global reduction 2 with 10 rules applied. Total rules applied 411 place count 328 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 412 place count 327 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 413 place count 327 transition count 283
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 697 place count 184 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 699 place count 183 transition count 145
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 705 place count 183 transition count 145
Applied a total of 705 rules in 54 ms. Remains 183 /552 variables (removed 369) and now considering 145/484 (removed 339) transitions.
// Phase 1: matrix 145 rows 183 cols
[2023-03-09 12:21:10] [INFO ] Computed 79 place invariants in 5 ms
[2023-03-09 12:21:10] [INFO ] Implicit Places using invariants in 163 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 38, 39, 40, 41, 42, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 165 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/552 places, 145/484 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 155/552 places, 145/484 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s48 0), p2:(AND (NOT (AND (EQ s27 1) (EQ s77 1) (EQ s125 1))) (NEQ s4 1)), p0:(AND (EQ s27 1) (EQ s77 1) (EQ s125 1))], nbAcceptance=2, 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 12 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 390 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 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 540 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 540 transition count 472
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 535 transition count 467
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 532 transition count 464
Applied a total of 40 rules in 144 ms. Remains 532 /552 variables (removed 20) and now considering 464/484 (removed 20) transitions.
// Phase 1: matrix 464 rows 532 cols
[2023-03-09 12:21:11] [INFO ] Computed 106 place invariants in 5 ms
[2023-03-09 12:21:11] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-09 12:21:11] [INFO ] Invariant cache hit.
[2023-03-09 12:21:11] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2023-03-09 12:21:11] [INFO ] Invariant cache hit.
[2023-03-09 12:21:12] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/552 places, 464/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1104 ms. Remains : 532/552 places, 464/484 transitions.
Stuttering acceptance computed with spot in 235 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-18-LTLFireability-04 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 (AND (EQ s120 1) (EQ s353 1) (EQ s508 1)) (EQ s310 1)), p0:(EQ s310 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 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 1356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 540 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 540 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Applied a total of 38 rules in 142 ms. Remains 533 /552 variables (removed 19) and now considering 465/484 (removed 19) transitions.
// Phase 1: matrix 465 rows 533 cols
[2023-03-09 12:21:12] [INFO ] Computed 106 place invariants in 10 ms
[2023-03-09 12:21:12] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-09 12:21:12] [INFO ] Invariant cache hit.
[2023-03-09 12:21:13] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2023-03-09 12:21:13] [INFO ] Invariant cache hit.
[2023-03-09 12:21:13] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/552 places, 465/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1355 ms. Remains : 533/552 places, 465/484 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s475 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-05 finished in 1489 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))))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 540 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 540 transition count 472
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 535 transition count 467
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 532 transition count 464
Applied a total of 40 rules in 82 ms. Remains 532 /552 variables (removed 20) and now considering 464/484 (removed 20) transitions.
// Phase 1: matrix 464 rows 532 cols
[2023-03-09 12:21:13] [INFO ] Computed 106 place invariants in 10 ms
[2023-03-09 12:21:14] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-09 12:21:14] [INFO ] Invariant cache hit.
[2023-03-09 12:21:14] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-09 12:21:14] [INFO ] Invariant cache hit.
[2023-03-09 12:21:14] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 532/552 places, 464/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1081 ms. Remains : 532/552 places, 464/484 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s406 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 583 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 1218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||F(!p1)))||((p0||F(!p1))&&F(G(p2)))))'
Support contains 5 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (complete) has 1232 edges and 552 vertex of which 551 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 550 transition count 416
Reduce places removed 66 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 484 transition count 414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 482 transition count 414
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 137 place count 482 transition count 296
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 397 place count 340 transition count 296
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 408 place count 329 transition count 285
Iterating global reduction 3 with 11 rules applied. Total rules applied 419 place count 329 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 328 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 328 transition count 284
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 706 place count 184 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 707 place count 184 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 709 place count 183 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 710 place count 182 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 711 place count 181 transition count 144
Applied a total of 711 rules in 64 ms. Remains 181 /552 variables (removed 371) and now considering 144/484 (removed 340) transitions.
// Phase 1: matrix 144 rows 181 cols
[2023-03-09 12:21:15] [INFO ] Computed 78 place invariants in 4 ms
[2023-03-09 12:21:15] [INFO ] Implicit Places using invariants in 130 ms returned [42, 43, 44, 45, 46, 47, 48, 49, 50, 53, 54, 159]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 132 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/552 places, 144/484 transitions.
Applied a total of 0 rules in 5 ms. Remains 169 /169 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 201 ms. Remains : 169/552 places, 144/484 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s126 1), p1:(AND (EQ s40 1) (EQ s89 1) (EQ s150 1)), p2:(NEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8355 reset in 235 ms.
Product exploration explored 100000 steps with 8526 reset in 246 ms.
Computed a total of 149 stabilizing places and 130 stable transitions
Computed a total of 149 stabilizing places and 130 stable transitions
Detected a total of 149/169 stabilizing places and 130/144 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 650 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 847 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 307 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 318 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 310 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 597860 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{1=1}
Probabilistic random walk after 597860 steps, saw 182172 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 144 rows 169 cols
[2023-03-09 12:21:20] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-09 12:21:20] [INFO ] [Real]Absence check using 53 positive place invariants in 10 ms returned sat
[2023-03-09 12:21:20] [INFO ] [Real]Absence check using 53 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-09 12:21:20] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND p1 (NOT p0))))
Knowledge based reduction with 12 factoid took 248 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-08 finished in 5380 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 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 267 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1225 edges and 547 vertex of which 546 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 545 transition count 407
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 476 transition count 407
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 140 place count 476 transition count 293
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 392 place count 338 transition count 293
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 402 place count 328 transition count 283
Iterating global reduction 2 with 10 rules applied. Total rules applied 412 place count 328 transition count 283
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 413 place count 327 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 327 transition count 282
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 701 place count 182 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 703 place count 181 transition count 143
Applied a total of 703 rules in 64 ms. Remains 181 /552 variables (removed 371) and now considering 143/484 (removed 341) transitions.
// Phase 1: matrix 143 rows 181 cols
[2023-03-09 12:21:20] [INFO ] Computed 79 place invariants in 4 ms
[2023-03-09 12:21:20] [INFO ] Implicit Places using invariants in 146 ms returned [1, 2, 5, 6, 7, 8, 9, 10, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 148 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/552 places, 143/484 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 153/552 places, 143/484 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s111 1) (EQ s1 1) (EQ s33 1) (EQ s103 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 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-09 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X((G(p2) U (p0&&X(p3))))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 474
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 474
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 537 transition count 469
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 537 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 536 transition count 468
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Applied a total of 36 rules in 101 ms. Remains 534 /552 variables (removed 18) and now considering 466/484 (removed 18) transitions.
// Phase 1: matrix 466 rows 534 cols
[2023-03-09 12:21:20] [INFO ] Computed 106 place invariants in 11 ms
[2023-03-09 12:21:21] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-09 12:21:21] [INFO ] Invariant cache hit.
[2023-03-09 12:21:21] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-09 12:21:21] [INFO ] Invariant cache hit.
[2023-03-09 12:21:22] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 534/552 places, 466/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 534/552 places, 466/484 transitions.
Stuttering acceptance computed with spot in 789 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3), (NOT p3), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) p0 (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 9}, { cond=p0, acceptance={0} source=3 dest: 11}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=10 dest: 13}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0} source=11 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p3)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=13 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=13 dest: 13}]], initial=0, aps=[p1:(EQ s378 1), p0:(EQ s448 1), p2:(EQ s79 1), p3:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 2187 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 270 edges and 552 vertex of which 6 / 552 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1225 edges and 547 vertex of which 546 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 545 transition count 407
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 476 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 475 transition count 406
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 142 place count 475 transition count 291
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 396 place count 336 transition count 291
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 407 place count 325 transition count 280
Iterating global reduction 3 with 11 rules applied. Total rules applied 418 place count 325 transition count 280
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 419 place count 324 transition count 279
Iterating global reduction 3 with 1 rules applied. Total rules applied 420 place count 324 transition count 279
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 3 with 287 rules applied. Total rules applied 707 place count 179 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 709 place count 178 transition count 140
Applied a total of 709 rules in 58 ms. Remains 178 /552 variables (removed 374) and now considering 140/484 (removed 344) transitions.
// Phase 1: matrix 140 rows 178 cols
[2023-03-09 12:21:22] [INFO ] Computed 79 place invariants in 2 ms
[2023-03-09 12:21:23] [INFO ] Implicit Places using invariants in 147 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 154]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 150 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 149/552 places, 140/484 transitions.
Applied a total of 0 rules in 4 ms. Remains 149 /149 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 149/552 places, 140/484 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s26 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-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 finished in 272 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&&F(p1))) U X(p1))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 540 transition count 472
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 540 transition count 472
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 536 transition count 468
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 536 transition count 468
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 535 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 535 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 534 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Applied a total of 38 rules in 79 ms. Remains 533 /552 variables (removed 19) and now considering 465/484 (removed 19) transitions.
// Phase 1: matrix 465 rows 533 cols
[2023-03-09 12:21:23] [INFO ] Computed 106 place invariants in 8 ms
[2023-03-09 12:21:23] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-09 12:21:23] [INFO ] Invariant cache hit.
[2023-03-09 12:21:24] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2023-03-09 12:21:24] [INFO ] Invariant cache hit.
[2023-03-09 12:21:24] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 533/552 places, 465/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1395 ms. Remains : 533/552 places, 465/484 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13 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=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s60 1), p1:(AND (EQ s230 1) (EQ s425 1) (EQ s504 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 1620 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 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 539 transition count 471
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 539 transition count 471
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 534 transition count 466
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 534 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 533 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 533 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 532 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 532 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 531 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 531 transition count 463
Applied a total of 42 rules in 59 ms. Remains 531 /552 variables (removed 21) and now considering 463/484 (removed 21) transitions.
// Phase 1: matrix 463 rows 531 cols
[2023-03-09 12:21:24] [INFO ] Computed 106 place invariants in 5 ms
[2023-03-09 12:21:25] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-09 12:21:25] [INFO ] Invariant cache hit.
[2023-03-09 12:21:25] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-09 12:21:25] [INFO ] Invariant cache hit.
[2023-03-09 12:21:25] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 531/552 places, 463/484 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1057 ms. Remains : 531/552 places, 463/484 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s175 1) (EQ s368 1) (EQ s477 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]]
Product exploration explored 100000 steps with 531 reset in 224 ms.
Entered a terminal (fully accepting) state of product in 59092 steps with 316 reset in 172 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 1567 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 484/484 transitions.
Graph (trivial) has 269 edges and 552 vertex of which 6 / 552 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 1225 edges and 547 vertex of which 546 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 545 transition count 407
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 476 transition count 407
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 116 Pre rules applied. Total rules applied 140 place count 476 transition count 291
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 257 rules applied. Total rules applied 397 place count 335 transition count 291
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 408 place count 324 transition count 280
Iterating global reduction 2 with 11 rules applied. Total rules applied 419 place count 324 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 420 place count 323 transition count 279
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 323 transition count 279
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 285 rules applied. Total rules applied 706 place count 179 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 708 place count 178 transition count 141
Applied a total of 708 rules in 45 ms. Remains 178 /552 variables (removed 374) and now considering 141/484 (removed 343) transitions.
// Phase 1: matrix 141 rows 178 cols
[2023-03-09 12:21:26] [INFO ] Computed 78 place invariants in 3 ms
[2023-03-09 12:21:26] [INFO ] Implicit Places using invariants in 227 ms returned [1, 2, 3, 4, 5, 9, 10, 13, 14, 15, 16, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 240 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/552 places, 141/484 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 151/552 places, 141/484 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 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-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 415 ms.
All properties solved by simple procedures.
Total runtime 34902 ms.

BK_STOP 1678364487057

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-18"
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-18, 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-167813690600588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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