Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400339
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 63K May 10 09:33 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-03-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652623296738

Running Version 202205111006
[2022-05-15 14:01:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2022-05-15 14:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:01:38] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-05-15 14:01:38] [INFO ] Transformed 274 places.
[2022-05-15 14:01:38] [INFO ] Transformed 237 transitions.
[2022-05-15 14:01:38] [INFO ] Found NUPN structural information;
[2022-05-15 14:01:38] [INFO ] Parsed PT model containing 274 places and 237 transitions in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 231 transition count 196
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 231 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 231 transition count 195
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 103 place count 211 transition count 175
Iterating global reduction 2 with 20 rules applied. Total rules applied 123 place count 211 transition count 175
Applied a total of 123 rules in 70 ms. Remains 211 /273 variables (removed 62) and now considering 175/236 (removed 61) transitions.
// Phase 1: matrix 175 rows 211 cols
[2022-05-15 14:01:38] [INFO ] Computed 41 place invariants in 13 ms
[2022-05-15 14:01:38] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 175 rows 211 cols
[2022-05-15 14:01:38] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-15 14:01:38] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
// Phase 1: matrix 175 rows 211 cols
[2022-05-15 14:01:38] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 14:01:38] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/273 places, 175/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/273 places, 175/236 transitions.
Support contains 23 out of 211 places after structural reductions.
[2022-05-15 14:01:39] [INFO ] Flatten gal took : 39 ms
[2022-05-15 14:01:39] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 14:01:39] [INFO ] Flatten gal took : 15 ms
[2022-05-15 14:01:39] [INFO ] Input system was already deterministic with 175 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 175 rows 211 cols
[2022-05-15 14:01:39] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 14:01:39] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 14:01:39] [INFO ] [Nat]Absence check using 41 positive place invariants in 23 ms returned sat
[2022-05-15 14:01:39] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 14:01:39] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 4 ms to minimize.
[2022-05-15 14:01:39] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2022-05-15 14:01:39] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2022-05-15 14:01:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
[2022-05-15 14:01:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2022-05-15 14:01:40] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2022-05-15 14:01:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 344 ms
[2022-05-15 14:01:40] [INFO ] After 423ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-15 14:01:40] [INFO ] After 521ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 129 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 205 stabilizing places and 167 stable transitions
Graph (complete) has 442 edges and 211 vertex of which 210 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((F(!X(G(!G(p0))))||F(p0)))))'
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Graph (trivial) has 110 edges and 211 vertex of which 6 / 211 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 435 edges and 206 vertex of which 205 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 204 transition count 140
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 177 transition count 140
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 56 place count 177 transition count 98
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 150 place count 125 transition count 98
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 156 place count 119 transition count 92
Iterating global reduction 2 with 6 rules applied. Total rules applied 162 place count 119 transition count 92
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 274 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 60 transition count 36
Applied a total of 276 rules in 38 ms. Remains 60 /211 variables (removed 151) and now considering 36/175 (removed 139) transitions.
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:40] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:40] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 26 places :
Implicit Place search using SMT with State Equation took 120 ms to find 26 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/211 places, 36/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 28 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 25 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 25 transition count 27
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 25 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 24 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 23 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 23 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 20 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 20 transition count 21
Applied a total of 29 rules in 6 ms. Remains 20 /34 variables (removed 14) and now considering 21/36 (removed 15) transitions.
// Phase 1: matrix 21 rows 20 cols
[2022-05-15 14:01:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 21 rows 20 cols
[2022-05-15 14:01:40] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/211 places, 21/175 transitions.
Finished structural reductions, in 2 iterations. Remains : 20/211 places, 21/175 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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 2 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-02 finished in 400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Graph (trivial) has 109 edges and 211 vertex of which 6 / 211 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 435 edges and 206 vertex of which 205 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 204 transition count 140
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 177 transition count 140
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 56 place count 177 transition count 100
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 146 place count 127 transition count 100
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 123 transition count 96
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 123 transition count 96
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 274 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 60 transition count 36
Applied a total of 276 rules in 25 ms. Remains 60 /211 variables (removed 151) and now considering 36/175 (removed 139) transitions.
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:40] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:40] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 38, 39, 41, 43, 45]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 106 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/211 places, 36/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 32 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 26 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 23 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 23 transition count 27
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 23 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 23 place count 20 transition count 24
Iterating global reduction 4 with 1 rules applied. Total rules applied 24 place count 20 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 30 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 17 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 17 transition count 20
Applied a total of 32 rules in 4 ms. Remains 17 /32 variables (removed 15) and now considering 20/36 (removed 16) transitions.
// Phase 1: matrix 20 rows 17 cols
[2022-05-15 14:01:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 17 cols
[2022-05-15 14:01:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:01:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/211 places, 20/175 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/211 places, 20/175 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 735 steps with 178 reset in 8 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-04 finished in 260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 169
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 203 transition count 167
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 203 transition count 167
Applied a total of 16 rules in 23 ms. Remains 203 /211 variables (removed 8) and now considering 167/175 (removed 8) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:41] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:41] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/211 places, 167/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/211 places, 167/175 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s158 0) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2676 steps with 45 reset in 16 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-05 finished in 414 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(((p1 U p2)&&F(p0)))))'
Support contains 4 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 204 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 204 transition count 168
Applied a total of 14 rules in 12 ms. Remains 204 /211 variables (removed 7) and now considering 168/175 (removed 7) transitions.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:41] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:41] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:41] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:41] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/211 places, 168/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/211 places, 168/175 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 5}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(EQ s52 1), p2:(EQ s50 1), p1:(OR (EQ s1 0) (EQ s132 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-08 finished in 563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(G(p0))))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Graph (trivial) has 109 edges and 211 vertex of which 6 / 211 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 435 edges and 206 vertex of which 205 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 204 transition count 140
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 177 transition count 140
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 56 place count 177 transition count 99
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 148 place count 126 transition count 99
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 121 transition count 94
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 121 transition count 94
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 272 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 273 place count 62 transition count 37
Applied a total of 273 rules in 27 ms. Remains 62 /211 variables (removed 149) and now considering 37/175 (removed 138) transitions.
// Phase 1: matrix 37 rows 62 cols
[2022-05-15 14:01:42] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 37 rows 62 cols
[2022-05-15 14:01:42] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-15 14:01:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 107 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/211 places, 37/175 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 33 transition count 31
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 24 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 24 transition count 28
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 24 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 22 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 28 place count 19 transition count 23
Applied a total of 28 rules in 5 ms. Remains 19 /33 variables (removed 14) and now considering 23/37 (removed 14) transitions.
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 14:01:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 14:01:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/211 places, 23/175 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/211 places, 23/175 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s16 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 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-10 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0))||p1))))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 205 transition count 169
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 205 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 204 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 204 transition count 168
Applied a total of 14 rules in 14 ms. Remains 204 /211 variables (removed 7) and now considering 168/175 (removed 7) transitions.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:42] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:42] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-15 14:01:42] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:42] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-15 14:01:42] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/211 places, 168/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/211 places, 168/175 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s72 1), p0:(EQ s191 0)], 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 1179 reset in 255 ms.
Product exploration explored 100000 steps with 1176 reset in 196 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 431 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 379 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 112 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished Best-First random walk after 1548 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=516 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Graph (trivial) has 101 edges and 204 vertex of which 6 / 204 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 424 edges and 199 vertex of which 198 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 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 197 transition count 138
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 175 transition count 138
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 46 place count 175 transition count 96
Deduced a syphon composed of 42 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 140 place count 123 transition count 96
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 256 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 62 transition count 38
Applied a total of 258 rules in 22 ms. Remains 62 /204 variables (removed 142) and now considering 38/168 (removed 130) transitions.
// Phase 1: matrix 38 rows 62 cols
[2022-05-15 14:01:44] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:01:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 38 rows 62 cols
[2022-05-15 14:01:44] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 14:01:44] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 17 places :
Implicit Place search using SMT with State Equation took 104 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/204 places, 38/168 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 32
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 39 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 38 transition count 31
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 35 transition count 28
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 35 transition count 28
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 35 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 24 place count 33 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 30 place count 30 transition count 23
Applied a total of 30 rules in 5 ms. Remains 30 /45 variables (removed 15) and now considering 23/38 (removed 15) transitions.
// Phase 1: matrix 23 rows 30 cols
[2022-05-15 14:01:44] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 14:01:44] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 23 rows 30 cols
[2022-05-15 14:01:44] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 14:01:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 14:01:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [2, 4, 5, 6, 8, 9, 10]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 76 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/204 places, 23/168 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 23/204 places, 23/168 transitions.
Computed a total of 23 stabilizing places and 22 stable transitions
Computed a total of 23 stabilizing places and 22 stable transitions
Detected a total of 23/23 stabilizing places and 22/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8562 steps, including 2109 resets, run visited all 1 properties in 17 ms. (steps per millisecond=503 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19736 reset in 110 ms.
Product exploration explored 100000 steps with 19771 reset in 99 ms.
Built C files in :
/tmp/ltsmin6538428504374713992
[2022-05-15 14:01:45] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2022-05-15 14:01:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:01:45] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2022-05-15 14:01:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:01:45] [INFO ] Computing Do-Not-Accords matrix : 23 transitions.
[2022-05-15 14:01:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:01:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6538428504374713992
Running compilation step : cd /tmp/ltsmin6538428504374713992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin6538428504374713992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6538428504374713992;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15025403039941847803.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLCardinality-11 finished in 3370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(p1)||p2)&&(F(p4)||p3))))'
Support contains 6 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 204 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 202 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 202 transition count 166
Applied a total of 18 rules in 12 ms. Remains 202 /211 variables (removed 9) and now considering 166/175 (removed 9) transitions.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:45] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:45] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:45] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:45] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:45] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-15 14:01:46] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 166/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/211 places, 166/175 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4)))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p4)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p4) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p4)) (AND (NOT p3) (NOT p4))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s104 0) (EQ s179 1)), p2:(AND (EQ s164 0) (EQ s62 1)), p3:(OR (EQ s88 0) (EQ s68 1)), p4:(OR (EQ s88 0) (EQ s68 1)), p1:(AND (EQ s68 0) (EQ s88...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 98084 steps with 12180 reset in 331 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-13 finished in 1092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 3 out of 211 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 204 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 202 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 202 transition count 166
Applied a total of 18 rules in 13 ms. Remains 202 /211 variables (removed 9) and now considering 166/175 (removed 9) transitions.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:46] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:46] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:46] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:01:47] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2022-05-15 14:01:47] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:47] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/211 places, 166/175 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/211 places, 166/175 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s187 0) (EQ s19 1)), p0:(EQ s20 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6978 steps with 81 reset in 9 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 699 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 211 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 211/211 places, 175/175 transitions.
Graph (trivial) has 109 edges and 211 vertex of which 6 / 211 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 435 edges and 206 vertex of which 205 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 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 28 place count 204 transition count 141
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 178 transition count 141
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 54 place count 178 transition count 100
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 146 place count 127 transition count 100
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 122 transition count 95
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 122 transition count 95
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 274 place count 62 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 275 place count 61 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 276 place count 60 transition count 36
Applied a total of 276 rules in 44 ms. Remains 60 /211 variables (removed 151) and now considering 36/175 (removed 139) transitions.
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:47] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:01:47] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2022-05-15 14:01:47] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 14:01:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 174 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/211 places, 36/175 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 33 transition count 31
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 28 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 27 transition count 30
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 15 place count 24 transition count 27
Iterating global reduction 3 with 3 rules applied. Total rules applied 18 place count 24 transition count 27
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 24 transition count 25
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 22 place count 22 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 21 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 21 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 30 place count 18 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 31 place count 18 transition count 20
Applied a total of 31 rules in 3 ms. Remains 18 /33 variables (removed 15) and now considering 20/36 (removed 16) transitions.
// Phase 1: matrix 20 rows 18 cols
[2022-05-15 14:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 14:01:47] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 20 rows 18 cols
[2022-05-15 14:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 14:01:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/211 places, 20/175 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/211 places, 20/175 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-15 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 s7 0) (NEQ s4 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-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-15 finished in 348 ms.
All properties solved by simple procedures.
Total runtime 9858 ms.

BK_STOP 1652623307891

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -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=@none -Xss128m -Xms40m -Xmx8192m

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-03"
export BK_EXAMINATION="LTLCardinality"
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-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-03.tgz
mv BusinessProcesses-PT-03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;