fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143700325
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
753.271 49331.00 77260.00 308.40 FFFFFFFFFTFFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143700325.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 47K May 5 16:51 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-01-00
FORMULA_NAME BusinessProcesses-PT-01-01
FORMULA_NAME BusinessProcesses-PT-01-02
FORMULA_NAME BusinessProcesses-PT-01-03
FORMULA_NAME BusinessProcesses-PT-01-04
FORMULA_NAME BusinessProcesses-PT-01-05
FORMULA_NAME BusinessProcesses-PT-01-06
FORMULA_NAME BusinessProcesses-PT-01-07
FORMULA_NAME BusinessProcesses-PT-01-08
FORMULA_NAME BusinessProcesses-PT-01-09
FORMULA_NAME BusinessProcesses-PT-01-10
FORMULA_NAME BusinessProcesses-PT-01-11
FORMULA_NAME BusinessProcesses-PT-01-12
FORMULA_NAME BusinessProcesses-PT-01-13
FORMULA_NAME BusinessProcesses-PT-01-14
FORMULA_NAME BusinessProcesses-PT-01-15

=== Now, execution of the tool begins

BK_START 1620542296753

Running Version 0
[2021-05-09 06:38:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 06:38:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:38:19] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-09 06:38:19] [INFO ] Transformed 200 places.
[2021-05-09 06:38:19] [INFO ] Transformed 178 transitions.
[2021-05-09 06:38:19] [INFO ] Found NUPN structural information;
[2021-05-09 06:38:19] [INFO ] Parsed PT model containing 200 places and 178 transitions in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 06:38:19] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 1 transitions.
Support contains 31 out of 199 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 176 transition count 156
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 176 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 176 transition count 155
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 57 place count 164 transition count 143
Iterating global reduction 2 with 12 rules applied. Total rules applied 69 place count 164 transition count 143
Applied a total of 69 rules in 129 ms. Remains 164 /199 variables (removed 35) and now considering 143/177 (removed 34) transitions.
// Phase 1: matrix 143 rows 164 cols
[2021-05-09 06:38:19] [INFO ] Computed 28 place invariants in 15 ms
[2021-05-09 06:38:19] [INFO ] Implicit Places using invariants in 218 ms returned []
// Phase 1: matrix 143 rows 164 cols
[2021-05-09 06:38:19] [INFO ] Computed 28 place invariants in 8 ms
[2021-05-09 06:38:19] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
// Phase 1: matrix 143 rows 164 cols
[2021-05-09 06:38:19] [INFO ] Computed 28 place invariants in 12 ms
[2021-05-09 06:38:19] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 164/199 places, 143/177 transitions.
[2021-05-09 06:38:20] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 06:38:20] [INFO ] Flatten gal took : 42 ms
FORMULA BusinessProcesses-PT-01-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:38:20] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:38:20] [INFO ] Input system was already deterministic with 143 transitions.
Incomplete random walk after 100000 steps, including 1134 resets, run finished after 182 ms. (steps per millisecond=549 ) properties (out of 25) seen :23
Running SMT prover for 2 properties.
// Phase 1: matrix 143 rows 164 cols
[2021-05-09 06:38:20] [INFO ] Computed 28 place invariants in 5 ms
[2021-05-09 06:38:20] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2021-05-09 06:38:20] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-09 06:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:38:20] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-09 06:38:20] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
[2021-05-09 06:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-09 06:38:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:38:20] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2021-05-09 06:38:20] [INFO ] [Nat]Absence check using 18 positive and 10 generalized place invariants in 4 ms returned sat
[2021-05-09 06:38:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:38:20] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-09 06:38:20] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2021-05-09 06:38:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-09 06:38:20] [INFO ] Computed and/alt/rep : 139/257/139 causal constraints (skipped 3 transitions) in 10 ms.
[2021-05-09 06:38:21] [INFO ] Added : 118 causal constraints over 24 iterations in 371 ms. Result :sat
[2021-05-09 06:38:21] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2021-05-09 06:38:21] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 4 ms returned sat
[2021-05-09 06:38:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:38:21] [INFO ] [Real]Absence check using state equation in 78 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-09 06:38:21] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F(p0)))||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 153 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 153 transition count 132
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 147 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 147 transition count 126
Applied a total of 34 rules in 24 ms. Remains 147 /164 variables (removed 17) and now considering 126/143 (removed 17) transitions.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:21] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-09 06:38:21] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:21] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:22] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:22] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:22] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/164 places, 126/143 transitions.
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-01-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s88 1), p1:(EQ s132 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2213 reset in 304 ms.
Stack based approach found an accepted trace after 46 steps with 1 reset with depth 6 and stack size 6 in 1 ms.
FORMULA BusinessProcesses-PT-01-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-00 finished in 1505 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Graph (trivial) has 85 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 158 transition count 111
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 133 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 132 transition count 110
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 53 place count 132 transition count 85
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 109 place count 101 transition count 85
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 117 place count 93 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 93 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 125 place count 93 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 91 transition count 75
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 195 place count 58 transition count 42
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 197 place count 57 transition count 45
Applied a total of 197 rules in 46 ms. Remains 57 /164 variables (removed 107) and now considering 45/143 (removed 98) transitions.
// Phase 1: matrix 45 rows 57 cols
[2021-05-09 06:38:23] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-09 06:38:23] [INFO ] Implicit Places using invariants in 55 ms returned [1, 2, 7, 8, 9, 17]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 61 ms to find 6 implicit places.
[2021-05-09 06:38:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 51 cols
[2021-05-09 06:38:23] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-09 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 51/164 places, 45/143 transitions.
Applied a total of 0 rules in 14 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2021-05-09 06:38:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 51 cols
[2021-05-09 06:38:23] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/164 places, 45/143 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-01-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s43 1), p2:(AND (NEQ s14 1) (NEQ s22 1) (NEQ s1 1)), p1:(AND (NEQ s22 1) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-01-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-01 finished in 451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&G(F(p1))) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 153 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 153 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 148 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 148 transition count 127
Applied a total of 32 rules in 25 ms. Remains 148 /164 variables (removed 16) and now considering 127/143 (removed 16) transitions.
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:23] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:23] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:23] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:23] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:23] [INFO ] Computed 28 place invariants in 9 ms
[2021-05-09 06:38:23] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 148/164 places, 127/143 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-01-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s128 1), p0:(EQ s88 1), p1:(EQ s89 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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-01-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-03 finished in 601 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0 U X(X((!p0 U (p1||G(!p0)))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 151 transition count 130
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 151 transition count 130
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 146 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 146 transition count 125
Applied a total of 36 rules in 14 ms. Remains 146 /164 variables (removed 18) and now considering 125/143 (removed 18) transitions.
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:24] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:24] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:24] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:24] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2021-05-09 06:38:24] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 146/164 places, 125/143 transitions.
Stuttering acceptance computed with spot in 433 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-01-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={} source=5 dest: 8}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={} source=9 dest: 6}]], initial=0, aps=[p0:(EQ s21 1), p1:(AND (NEQ s21 1) (NEQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35246 steps with 4712 reset in 77 ms.
FORMULA BusinessProcesses-PT-01-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-04 finished in 855 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(((G(p1) U p2)||G(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Graph (trivial) has 84 edges and 164 vertex of which 4 / 164 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 160 transition count 113
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 134 transition count 113
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 53 place count 134 transition count 88
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 109 place count 103 transition count 88
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 119 place count 93 transition count 78
Iterating global reduction 2 with 10 rules applied. Total rules applied 129 place count 93 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 129 place count 93 transition count 77
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 131 place count 92 transition count 77
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 203 place count 56 transition count 41
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 205 place count 55 transition count 44
Applied a total of 205 rules in 87 ms. Remains 55 /164 variables (removed 109) and now considering 44/143 (removed 99) transitions.
// Phase 1: matrix 44 rows 55 cols
[2021-05-09 06:38:25] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-09 06:38:25] [INFO ] Implicit Places using invariants in 92 ms returned [1, 2, 7, 8, 9, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 95 ms to find 6 implicit places.
[2021-05-09 06:38:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 49 cols
[2021-05-09 06:38:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-09 06:38:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 49/164 places, 44/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2021-05-09 06:38:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 44 rows 49 cols
[2021-05-09 06:38:25] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-09 06:38:25] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/164 places, 44/143 transitions.
Stuttering acceptance computed with spot in 897 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-01-05 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1) (AND p0 p3)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={2} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 2} source=0 dest: 4}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=0 dest: 5}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=0 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR p2 p1 p3), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=1 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={0, 2} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=1 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=1 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p2) p1 p3)), acceptance={2} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={0, 2} source=2 dest: 4}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={1, 2} source=2 dest: 5}, { cond=(AND p0 p2 p1 p3), acceptance={} source=2 dest: 7}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={0} source=2 dest: 8}, { cond=(AND p0 p2 p1 (NOT p3)), acceptance={1} source=2 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=3 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={2} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0, 2} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p2) (NOT p1) p3)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=4 dest: 5}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(OR (AND p0 p2 p3) (AND p0 p1 p3)), acceptance={0} source=4 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(OR (AND p0 p2 (NOT p1)) (AND p0 (NOT p1) p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={2} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 2} source=5 dest: 4}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1 (NOT p3))), acceptance={1, 2} source=5 dest: 5}, { cond=(OR (AND p0 p2 p1) (AND p0 p1 p3)), acceptance={1} source=5 dest: 9}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={2} source=6 dest: 2}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0, 2} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0, 2} source=6 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p2) p1 (NOT p3))), acceptance={1, 2} source=6 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p2) p1 (NOT p3))), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={1} source=6 dest: 9}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0, 1} source=6 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=7 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=7 dest: 5}, { cond=(AND p2 p1 p3), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1) p3), acceptance={0} source=7 dest: 8}, { cond=(AND p2 p1 (NOT p3)), acceptance={1} source=7 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=8 dest: 0}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=8 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={0, 2} source=8 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=8 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=8 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=9 dest: 0}, { cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p3)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=9 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=9 dest: 5}, { cond=(OR (AND p2 p1) (AND p1 p3)), acceptance={1} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1, 2} source=10 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 1} source=10 dest: 1}, { cond=(AND (NOT p2) p1 p3), acceptance={2} source=10 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={0, 2} source=10 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0, 2} source=10 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={1, 2} source=10 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0, 1, 2} source=10 dest: 6}, { cond=(AND (NOT p2) p1 p3), acceptance={1} source=10 dest: 9}, { cond=(AND (NOT p2) p1 p3), acceptance={0, 1} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s2 1), p2:(EQ s21 0), p1:(EQ s34 1), p3:(NEQ s6 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-01-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-05 finished in 1269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 152 transition count 131
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 152 transition count 131
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 147 transition count 126
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 147 transition count 126
Applied a total of 34 rules in 7 ms. Remains 147 /164 variables (removed 17) and now considering 126/143 (removed 17) transitions.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:26] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:26] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:26] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:26] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 147 cols
[2021-05-09 06:38:26] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-09 06:38:26] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/164 places, 126/143 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-01-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s120 1) (NEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-01-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-01-06 finished in 566 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((p0||(p1 U G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 164/164 places, 143/143 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 153 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 153 transition count 132
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 148 transition count 127
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 148 transition count 127
Applied a total of 32 rules in 28 ms. Remains 148 /164 variables (removed 16) and now considering 127/143 (removed 16) transitions.
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:26] [INFO ] Computed 28 place invariants in 2 ms
[2021-05-09 06:38:26] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:26] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:38:27] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 148 cols
[2021-05-09 06:38:27] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:27] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 148/164 places, 127/143 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-01-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s110 1), p2:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4573 reset in 202 ms.
Product exploration explored 100000 steps with 4546 reset in 388 ms.
Graph (complete) has 319 edges and 148 vertex of which 147 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [(NOT p0), p2]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4545 reset in 120 ms.
Product exploration explored 100000 steps with 4563 reset in 195 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 148 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 148/148 places, 127/127 transitions.
Graph (trivial) has 70 edges and 148 vertex of which 6 / 148 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.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 143 transition count 121
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 16 place count 143 transition count 167
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 42 place count 143 transition count 167
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 138 transition count 152
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 138 transition count 152
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 92 place count 138 transition count 152
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 103 place count 127 transition count 141
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 114 place count 127 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 127 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 126 transition count 154
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 126 transition count 154
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 117 rules in 36 ms. Remains 126 /148 variables (removed 22) and now considering 154/127 (removed -27) transitions.
[2021-05-09 06:38:29] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 154 rows 126 cols
[2021-05-09 06:38:29] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:37] [INFO ] Dead Transitions using invariants and state equation in 7878 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/148 places, 154/127 transitions.
Product exploration explored 100000 steps with 15411 reset in 648 ms.
Product exploration explored 100000 steps with 15481 reset in 295 ms.
Starting structural reductions, iteration 0 : 148/148 places, 127/127 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 145 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 145 transition count 124
Applied a total of 6 rules in 8 ms. Remains 145 /148 variables (removed 3) and now considering 124/127 (removed 3) transitions.
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:38] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:38] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:38] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:38:38] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2021-05-09 06:38:38] [INFO ] Computed 28 place invariants in 3 ms
[2021-05-09 06:38:41] [INFO ] Dead Transitions using invariants and state equation in 2318 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/148 places, 124/127 transitions.
[2021-05-09 06:38:41] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:38:41] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:38:41] [INFO ] Time to serialize gal into /tmp/LTL9739017499822212716.gal : 7 ms
[2021-05-09 06:38:41] [INFO ] Time to serialize properties into /tmp/LTL9121726374222034276.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9739017499822212716.gal, -t, CGAL, -LTL, /tmp/LTL9121726374222034276.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9739017499822212716.gal -t CGAL -LTL /tmp/LTL9121726374222034276.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 6 LTL properties
Checking formula 0 : !((X(X(F(("(p130==1)")||(("(p169==1)")U(G("(p11!=1)"))))))))
Formula 0 simplified : !XXF("(p130==1)" | ("(p169==1)" U G"(p11!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t11, t15, t18, t30, t31, t33, t37, t38, t40, t43, t47, t48, t51, t52, t55, t56, t58, t63, t66, t70, t74, t75, t78, t79, t82, t83, t86, t89, t92, t94, t98, t99, t102, t105, t107, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/102/37/143
Computing Next relation with stutter on 105 deadlock states
Detected timeout of ITS tools.
[2021-05-09 06:38:56] [INFO ] Flatten gal took : 15 ms
[2021-05-09 06:38:56] [INFO ] Applying decomposition
[2021-05-09 06:38:56] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1800157870045555380.txt, -o, /tmp/graph1800157870045555380.bin, -w, /tmp/graph1800157870045555380.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1800157870045555380.bin, -l, -1, -v, -w, /tmp/graph1800157870045555380.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:38:56] [INFO ] Decomposing Gal with order
[2021-05-09 06:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:38:56] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-09 06:38:56] [INFO ] Flatten gal took : 59 ms
[2021-05-09 06:38:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-09 06:38:56] [INFO ] Time to serialize gal into /tmp/LTL17755804288164466647.gal : 5 ms
[2021-05-09 06:38:56] [INFO ] Time to serialize properties into /tmp/LTL14322876436043696007.ltl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17755804288164466647.gal, -t, CGAL, -LTL, /tmp/LTL14322876436043696007.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17755804288164466647.gal -t CGAL -LTL /tmp/LTL14322876436043696007.ltl -c -stutter-deadlock
Read 6 LTL properties
Checking formula 0 : !((X(X(F(("(i11.i1.u44.p130==1)")||(("(i13.u53.p169==1)")U(G("(i3.u4.p11!=1)"))))))))
Formula 0 simplified : !XXF("(i11.i1.u44.p130==1)" | ("(i13.u53.p169==1)" U G"(i3.u4.p11!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t75, t79, t83, t99, i0.u19.t78, i1.u7.t102, i2.i0.u41.t43, i2.i1.t47, i2.i1.u39.t48, i3.t105, i3.u4.t107, i4.t92, i4.i0.t89, i4.i0.t98, i4.i1.t94, i5.u15.t86, i6.u17.t82, i7.i0.t70, i7.i0.u21.t74, i7.i1.u42.t40, i8.i1.u27.t66, i9.i0.u34.t58, i9.i1.t51, i9.i1.u37.t52, i10.t55, i10.u35.t56, i11.i0.u45.t33, i11.i1.t37, i11.i1.u43.t38, i12.t30, i12.u46.t31, i12.u46.t63, i13.t18, i13.t15, i13.t6, i13.u48.t11, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :4/102/37/143
Computing Next relation with stutter on 105 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
45 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.503921,34664,1,0,41830,406,2468,54505,243,972,108466
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("(i7.i1.u57.p182==0)")&&(F(("(i7.i1.u57.p182!=1)")&&(X("(i7.i1.u57.p182!=1)")))))))
Formula 1 simplified : !G("(i7.i1.u57.p182==0)" & F("(i7.i1.u57.p182!=1)" & X"(i7.i1.u57.p182!=1)"))
Computing Next relation with stutter on 105 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
14 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.64507,41376,1,0,57810,462,2604,70135,250,1149,140702
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F(("(i12.u46.p137==0)")||(X("(i7.i1.u60.p196==1)"))))))
Formula 2 simplified : !XF("(i12.u46.p137==0)" | X"(i7.i1.u60.p196==1)")
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.645622,41376,1,0,57810,462,2611,70135,252,1149,140708
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-01-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F(G("((((i8.i0.u3.p9!=1)||(i4.i1.u13.p34!=1))||(i9.i1.u37.p108!=1))||(i13.u48.p193!=1))"))))
Formula 3 simplified : !FG"((((i8.i0.u3.p9!=1)||(i4.i1.u13.p34!=1))||(i9.i1.u37.p108!=1))||(i13.u48.p193!=1))"
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
262 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.26164,130588,1,0,261382,494,2663,271565,253,1513,461784
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F("((i13.u51.p161==1)||(i5.u54.p172==1))")))
Formula 4 simplified : !F"((i13.u51.p161==1)||(i5.u54.p172==1))"
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
17 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.42872,135340,1,0,271709,496,2708,284320,253,1555,487432
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F(G("(i7.i1.u24.p59==1)"))))
Formula 5 simplified : !FG"(i7.i1.u24.p59==1)"
Computing Next relation with stutter on 105 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
456 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.98677,265228,1,0,586178,503,2730,561804,253,1685,828481
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-01-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-01-07 finished in 39149 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542346084

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-01"
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-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-01, 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 r026-tajo-162038143700325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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