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-165251918400387.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-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400387
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 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.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 104K 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-09-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652627276708

Running Version 202205111006
[2022-05-15 15:07:57] [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 15:07:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:07:58] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2022-05-15 15:07:58] [INFO ] Transformed 403 places.
[2022-05-15 15:07:58] [INFO ] Transformed 374 transitions.
[2022-05-15 15:07:58] [INFO ] Found NUPN structural information;
[2022-05-15 15:07:58] [INFO ] Parsed PT model containing 403 places and 374 transitions in 198 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 2 formulas.
FORMULA BusinessProcesses-PT-09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 52 place count 351 transition count 323
Iterating global reduction 1 with 51 rules applied. Total rules applied 103 place count 351 transition count 323
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 124 place count 330 transition count 302
Iterating global reduction 1 with 21 rules applied. Total rules applied 145 place count 330 transition count 302
Applied a total of 145 rules in 82 ms. Remains 330 /403 variables (removed 73) and now considering 302/374 (removed 72) transitions.
// Phase 1: matrix 302 rows 330 cols
[2022-05-15 15:07:58] [INFO ] Computed 64 place invariants in 25 ms
[2022-05-15 15:07:58] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 302 rows 330 cols
[2022-05-15 15:07:58] [INFO ] Computed 64 place invariants in 7 ms
[2022-05-15 15:07:58] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
// Phase 1: matrix 302 rows 330 cols
[2022-05-15 15:07:58] [INFO ] Computed 64 place invariants in 11 ms
[2022-05-15 15:07:59] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 330/403 places, 302/374 transitions.
Finished structural reductions, in 1 iterations. Remains : 330/403 places, 302/374 transitions.
Support contains 22 out of 330 places after structural reductions.
[2022-05-15 15:07:59] [INFO ] Flatten gal took : 54 ms
[2022-05-15 15:07:59] [INFO ] Flatten gal took : 25 ms
[2022-05-15 15:07:59] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 21 out of 330 places (down from 22) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 302 rows 330 cols
[2022-05-15 15:07:59] [INFO ] Computed 64 place invariants in 6 ms
[2022-05-15 15:08:00] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 15:08:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-15 15:08:00] [INFO ] [Nat]Absence check using 35 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-15 15:08:00] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 15:08:00] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2022-05-15 15:08:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2022-05-15 15:08:00] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2022-05-15 15:08:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2022-05-15 15:08:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 194 ms
[2022-05-15 15:08:00] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2022-05-15 15:08:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-15 15:08:00] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 49 ms.
[2022-05-15 15:08:00] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 330 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 148 edges and 330 vertex of which 6 / 330 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 758 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 324 transition count 260
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 290 transition count 260
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 70 place count 290 transition count 193
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 214 place count 213 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 221 place count 206 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 228 place count 206 transition count 186
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 383 place count 127 transition count 110
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 385 place count 126 transition count 113
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 126 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 389 place count 124 transition count 111
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 390 place count 124 transition count 111
Applied a total of 390 rules in 66 ms. Remains 124 /330 variables (removed 206) and now considering 111/302 (removed 191) transitions.
Finished structural reductions, in 1 iterations. Remains : 124/330 places, 111/302 transitions.
Finished random walk after 1360 steps, including 84 resets, run visited all 3 properties in 9 ms. (steps per millisecond=151 )
FORMULA BusinessProcesses-PT-09-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 199 stabilizing places and 201 stable transitions
Graph (complete) has 765 edges and 330 vertex of which 329 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 320 transition count 292
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 320 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 317 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 317 transition count 289
Applied a total of 26 rules in 19 ms. Remains 317 /330 variables (removed 13) and now considering 289/302 (removed 13) transitions.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:01] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:01] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:01] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:01] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 289 rows 317 cols
[2022-05-15 15:08:01] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:01] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/330 places, 289/302 transitions.
Finished structural reductions, in 1 iterations. Remains : 317/330 places, 289/302 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s262 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-00 finished in 804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(p0)))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 318 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 318 transition count 290
Applied a total of 24 rules in 21 ms. Remains 318 /330 variables (removed 12) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:01] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:01] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:01] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:02] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:02] [INFO ] Computed 64 place invariants in 3 ms
[2022-05-15 15:08:02] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/330 places, 290/302 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/330 places, 290/302 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s293 0) (EQ s261 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 27492 steps with 292 reset in 136 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-01 finished in 846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U !p1)))'
Support contains 4 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 321 transition count 293
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 321 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 318 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 318 transition count 290
Applied a total of 24 rules in 15 ms. Remains 318 /330 variables (removed 12) and now considering 290/302 (removed 12) transitions.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:02] [INFO ] Computed 64 place invariants in 5 ms
[2022-05-15 15:08:02] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:02] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:03] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:03] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:03] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/330 places, 290/302 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/330 places, 290/302 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, p0, (NOT p1), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s121 0) (EQ s115 1)), p1:(OR (EQ s142 0) (EQ s257 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3188 reset in 241 ms.
Product exploration explored 100000 steps with 3250 reset in 263 ms.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 750 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (AND p0 p1)), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 104 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 97 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (AND p0 p1)), true, (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 312 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 102 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 318/318 places, 290/290 transitions.
Applied a total of 0 rules in 4 ms. Remains 318 /318 variables (removed 0) and now considering 290/290 (removed 0) transitions.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:04] [INFO ] Computed 64 place invariants in 6 ms
[2022-05-15 15:08:04] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:04] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-15 15:08:05] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 318 cols
[2022-05-15 15:08:05] [INFO ] Computed 64 place invariants in 1 ms
[2022-05-15 15:08:05] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 318/318 places, 290/290 transitions.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 750 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 85 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 123 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 3236 reset in 164 ms.
Product exploration explored 100000 steps with 3250 reset in 166 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 318/318 places, 290/290 transitions.
Graph (trivial) has 138 edges and 318 vertex of which 6 / 318 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 744 edges and 313 vertex of which 312 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
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 312 transition count 283
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 52 Pre rules applied. Total rules applied 28 place count 312 transition count 313
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 52 rules applied. Total rules applied 80 place count 312 transition count 313
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 89 place count 303 transition count 296
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 98 place count 303 transition count 296
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 192 place count 303 transition count 296
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 214 place count 281 transition count 274
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 236 place count 281 transition count 274
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 237 place count 281 transition count 284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 238 place count 280 transition count 282
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 239 place count 280 transition count 282
Deduced a syphon composed of 141 places in 0 ms
Applied a total of 239 rules in 70 ms. Remains 280 /318 variables (removed 38) and now considering 282/290 (removed 8) transitions.
[2022-05-15 15:08:07] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2022-05-15 15:08:07] [INFO ] Computed 64 place invariants in 5 ms
[2022-05-15 15:08:07] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/318 places, 282/290 transitions.
Finished structural reductions, in 1 iterations. Remains : 280/318 places, 282/290 transitions.
Product exploration explored 100000 steps with 25000 reset in 734 ms.
Product exploration explored 100000 steps with 25000 reset in 685 ms.
Built C files in :
/tmp/ltsmin1138827555178535633
[2022-05-15 15:08:08] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1138827555178535633
Running compilation step : cd /tmp/ltsmin1138827555178535633;'/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 511 ms.
Running link step : cd /tmp/ltsmin1138827555178535633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin1138827555178535633;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9967563545545455673.hoa' '--buchi-type=spotba'
LTSmin run took 3435 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-09-LTLCardinality-04 finished in 10126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(G(p0))))))'
Support contains 2 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 151 edges and 330 vertex of which 6 / 330 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 759 edges and 325 vertex of which 324 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 323 transition count 259
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 288 transition count 259
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 72 place count 288 transition count 193
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 213 place count 213 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 222 place count 204 transition count 184
Iterating global reduction 2 with 9 rules applied. Total rules applied 231 place count 204 transition count 184
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 388 place count 124 transition count 107
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 390 place count 123 transition count 110
Applied a total of 390 rules in 30 ms. Remains 123 /330 variables (removed 207) and now considering 110/302 (removed 192) transitions.
// Phase 1: matrix 110 rows 123 cols
[2022-05-15 15:08:12] [INFO ] Computed 52 place invariants in 1 ms
[2022-05-15 15:08:12] [INFO ] Implicit Places using invariants in 133 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42, 43]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 158 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/330 places, 110/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 111/330 places, 110/302 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s62 0) (EQ s84 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 9 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-05 finished in 236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 149 edges and 330 vertex of which 6 / 330 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 759 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 323 transition count 260
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 70 place count 289 transition count 260
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 70 place count 289 transition count 193
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 214 place count 212 transition count 193
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 221 place count 205 transition count 186
Iterating global reduction 2 with 7 rules applied. Total rules applied 228 place count 205 transition count 186
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 157 rules applied. Total rules applied 385 place count 125 transition count 109
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 387 place count 124 transition count 112
Applied a total of 387 rules in 31 ms. Remains 124 /330 variables (removed 206) and now considering 112/302 (removed 190) transitions.
// Phase 1: matrix 112 rows 124 cols
[2022-05-15 15:08:13] [INFO ] Computed 51 place invariants in 1 ms
[2022-05-15 15:08:13] [INFO ] Implicit Places using invariants in 129 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 130 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/330 places, 112/302 transitions.
Applied a total of 0 rules in 21 ms. Remains 113 /113 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 113/330 places, 112/302 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s79 0) (NEQ s73 1)), p1:(EQ s67 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 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-07 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Graph (trivial) has 153 edges and 330 vertex of which 6 / 330 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 759 edges and 325 vertex of which 324 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 323 transition count 258
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 74 place count 287 transition count 258
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 74 place count 287 transition count 190
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 220 place count 209 transition count 190
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 229 place count 200 transition count 181
Iterating global reduction 2 with 9 rules applied. Total rules applied 238 place count 200 transition count 181
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 153 rules applied. Total rules applied 391 place count 122 transition count 106
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 393 place count 121 transition count 109
Applied a total of 393 rules in 33 ms. Remains 121 /330 variables (removed 209) and now considering 109/302 (removed 193) transitions.
// Phase 1: matrix 109 rows 121 cols
[2022-05-15 15:08:13] [INFO ] Computed 51 place invariants in 0 ms
[2022-05-15 15:08:13] [INFO ] Implicit Places using invariants in 86 ms returned [1, 2, 3, 11, 37, 38, 39, 40, 41, 42, 43]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 88 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/330 places, 109/302 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/330 places, 109/302 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s15 0) (EQ s37 1)), p1:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-12 finished in 205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0)) U p1))'
Support contains 3 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 302/302 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 322 transition count 294
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 322 transition count 294
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 319 transition count 291
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 319 transition count 291
Applied a total of 22 rules in 20 ms. Remains 319 /330 variables (removed 11) and now considering 291/302 (removed 11) transitions.
// Phase 1: matrix 291 rows 319 cols
[2022-05-15 15:08:13] [INFO ] Computed 64 place invariants in 4 ms
[2022-05-15 15:08:13] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 291 rows 319 cols
[2022-05-15 15:08:13] [INFO ] Computed 64 place invariants in 9 ms
[2022-05-15 15:08:14] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
// Phase 1: matrix 291 rows 319 cols
[2022-05-15 15:08:14] [INFO ] Computed 64 place invariants in 2 ms
[2022-05-15 15:08:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 319/330 places, 291/302 transitions.
Finished structural reductions, in 1 iterations. Remains : 319/330 places, 291/302 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s242 0) (EQ s177 1)), p1:(EQ s311 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-15 finished in 771 ms.
All properties solved by simple procedures.
Total runtime 16492 ms.

BK_STOP 1652627294383

--------------------
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-09"
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-09, 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-165251918400387"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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