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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
670.716 26676.00 41080.00 172.70 FFFFFFFFTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 63K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620542500459

Running Version 0
[2021-05-09 06:41:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 06:41:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:41:42] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-09 06:41:42] [INFO ] Transformed 274 places.
[2021-05-09 06:41:42] [INFO ] Transformed 237 transitions.
[2021-05-09 06:41:42] [INFO ] Found NUPN structural information;
[2021-05-09 06:41:42] [INFO ] Parsed PT model containing 274 places and 237 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Support contains 41 out of 273 places. Attempting structural reductions.
Starting structural reductions, 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 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 240 transition count 205
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 240 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 240 transition count 204
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 77 place count 228 transition count 192
Iterating global reduction 2 with 12 rules applied. Total rules applied 89 place count 228 transition count 192
Applied a total of 89 rules in 59 ms. Remains 228 /273 variables (removed 45) and now considering 192/236 (removed 44) transitions.
// Phase 1: matrix 192 rows 228 cols
[2021-05-09 06:41:42] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-09 06:41:43] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 192 rows 228 cols
[2021-05-09 06:41:43] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:41:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
// Phase 1: matrix 192 rows 228 cols
[2021-05-09 06:41:43] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:43] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 228/273 places, 192/236 transitions.
[2021-05-09 06:41:43] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 06:41:43] [INFO ] Flatten gal took : 42 ms
FORMULA BusinessProcesses-PT-03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 06:41:43] [INFO ] Flatten gal took : 15 ms
[2021-05-09 06:41:43] [INFO ] Input system was already deterministic with 192 transitions.
Incomplete random walk after 100000 steps, including 1180 resets, run finished after 185 ms. (steps per millisecond=540 ) properties (out of 31) seen :28
Running SMT prover for 3 properties.
// Phase 1: matrix 192 rows 228 cols
[2021-05-09 06:41:43] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:41:43] [INFO ] [Real]Absence check using 41 positive place invariants in 18 ms returned sat
[2021-05-09 06:41:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:43] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 06:41:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2021-05-09 06:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:44] [INFO ] [Nat]Absence check using state equation in 65 ms returned unsat
[2021-05-09 06:41:44] [INFO ] [Real]Absence check using 41 positive place invariants in 15 ms returned sat
[2021-05-09 06:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:44] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 06:41:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:41:44] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2021-05-09 06:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 06:41:44] [INFO ] Computed and/alt/rep : 190/376/190 causal constraints (skipped 1 transitions) in 13 ms.
[2021-05-09 06:41:44] [INFO ] Added : 70 causal constraints over 15 iterations in 229 ms. Result :sat
[2021-05-09 06:41:44] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2021-05-09 06:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:41:44] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2021-05-09 06:41:44] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-03-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 210 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 202 transition count 166
Applied a total of 52 rules in 12 ms. Remains 202 /228 variables (removed 26) and now considering 166/192 (removed 26) transitions.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:44] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:44] [INFO ] Computed 41 place invariants in 5 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/228 places, 166/192 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-00 finished in 501 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)&&F(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 212 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 212 transition count 176
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 204 transition count 168
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 204 transition count 168
Applied a total of 48 rules in 8 ms. Remains 204 /228 variables (removed 24) and now considering 168/192 (removed 24) transitions.
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-09 06:41:45] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/228 places, 168/192 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s190 1), p1:(EQ s162 1), p2:(AND (EQ s42 1) (EQ s141 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-01 finished in 479 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(((p0&&X(p1))||X(X(p2))))&&(p3||G(p0)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 212 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 212 transition count 176
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 206 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 206 transition count 170
Applied a total of 44 rules in 10 ms. Remains 206 /228 variables (removed 22) and now considering 170/192 (removed 22) transitions.
// Phase 1: matrix 170 rows 206 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 170 rows 206 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 4 ms
[2021-05-09 06:41:45] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 206 cols
[2021-05-09 06:41:45] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:46] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/228 places, 170/192 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 6}, { cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s140 1), p3:(EQ s195 1), p1:(EQ s47 1), p2:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-02 finished in 552 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Graph (trivial) has 126 edges and 228 vertex of which 6 / 228 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 37 place count 222 transition count 149
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 186 transition count 149
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 73 place count 186 transition count 108
Deduced a syphon composed of 41 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 91 rules applied. Total rules applied 164 place count 136 transition count 108
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 181 place count 119 transition count 91
Iterating global reduction 2 with 17 rules applied. Total rules applied 198 place count 119 transition count 91
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 306 place count 64 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 307 place count 63 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 308 place count 62 transition count 37
Applied a total of 308 rules in 53 ms. Remains 62 /228 variables (removed 166) and now considering 37/192 (removed 155) transitions.
// Phase 1: matrix 37 rows 62 cols
[2021-05-09 06:41:46] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-09 06:41:46] [INFO ] Implicit Places using invariants in 46 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
[2021-05-09 06:41:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:41:46] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 61/228 places, 37/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2021-05-09 06:41:46] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:41:46] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/228 places, 37/192 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-03-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s58 1), p2:(AND (NEQ s28 0) (NEQ s58 0)), p1:(NEQ s58 0)], 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-03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-05 finished in 327 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X((X(p1) U ((p2&&X(p1))||X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 211 transition count 175
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 211 transition count 175
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 204 transition count 168
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 204 transition count 168
Applied a total of 48 rules in 7 ms. Remains 204 /228 variables (removed 24) and now considering 168/192 (removed 24) transitions.
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:46] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:46] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:46] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:46] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2021-05-09 06:41:46] [INFO ] Computed 41 place invariants in 2 ms
[2021-05-09 06:41:46] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/228 places, 168/192 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s182 1), p1:(OR (NEQ s27 1) (NEQ s140 1) (NEQ s203 1)), p2:(OR (NEQ s27 1) (NEQ s140 1) (NEQ s203 1) (AND (NEQ s15 0) (NEQ s120 0) (NEQ s203 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3874 steps with 85 reset in 28 ms.
FORMULA BusinessProcesses-PT-03-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-06 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Graph (trivial) has 124 edges and 228 vertex of which 6 / 228 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 222 transition count 151
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 188 transition count 151
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 69 place count 188 transition count 109
Deduced a syphon composed of 42 places in 1 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 163 place count 136 transition count 109
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 179 place count 120 transition count 93
Iterating global reduction 2 with 16 rules applied. Total rules applied 195 place count 120 transition count 93
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 305 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 306 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 307 place count 62 transition count 38
Applied a total of 307 rules in 21 ms. Remains 62 /228 variables (removed 166) and now considering 38/192 (removed 154) transitions.
// Phase 1: matrix 38 rows 62 cols
[2021-05-09 06:41:47] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 38 rows 62 cols
[2021-05-09 06:41:47] [INFO ] Computed 28 place invariants in 5 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [0, 1, 2, 3, 4, 5, 8, 9, 10, 11, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 114 ms to find 28 implicit places.
[2021-05-09 06:41:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 38 rows 34 cols
[2021-05-09 06:41:47] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-09 06:41:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 34/228 places, 38/192 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 34 transition count 31
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 27 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 24 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 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 22 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 24 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 25 place count 21 transition count 25
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 21 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 32 place count 18 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 33 place count 18 transition count 21
Applied a total of 33 rules in 7 ms. Remains 18 /34 variables (removed 16) and now considering 21/38 (removed 17) transitions.
// Phase 1: matrix 21 rows 18 cols
[2021-05-09 06:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 18 cols
[2021-05-09 06:41:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 18/228 places, 21/192 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s0 1), p1:(EQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 180 steps with 39 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-07 finished in 264 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 212 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 212 transition count 176
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 205 transition count 169
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 205 transition count 169
Applied a total of 46 rules in 10 ms. Remains 205 /228 variables (removed 23) and now considering 169/192 (removed 23) transitions.
// Phase 1: matrix 169 rows 205 cols
[2021-05-09 06:41:47] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 169 rows 205 cols
[2021-05-09 06:41:47] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:41:47] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 169 rows 205 cols
[2021-05-09 06:41:47] [INFO ] Computed 41 place invariants in 3 ms
[2021-05-09 06:41:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/228 places, 169/192 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : BusinessProcesses-PT-03-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s119 1), p2:(AND (NEQ s119 1) (NEQ s196 1)), p1:(NEQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1190 reset in 231 ms.
Product exploration explored 100000 steps with 1176 reset in 225 ms.
Graph (complete) has 432 edges and 205 vertex of which 204 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 1202 reset in 144 ms.
Product exploration explored 100000 steps with 1204 reset in 171 ms.
[2021-05-09 06:41:48] [INFO ] Flatten gal took : 13 ms
[2021-05-09 06:41:48] [INFO ] Flatten gal took : 12 ms
[2021-05-09 06:41:48] [INFO ] Time to serialize gal into /tmp/LTL9815981551976717144.gal : 6 ms
[2021-05-09 06:41:48] [INFO ] Time to serialize properties into /tmp/LTL7003913338830784675.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9815981551976717144.gal, -t, CGAL, -LTL, /tmp/LTL7003913338830784675.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9815981551976717144.gal -t CGAL -LTL /tmp/LTL7003913338830784675.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(("(p133!=1)")||(X(("(p259!=1)")U(("((p133!=1)&&(p259!=1))")||(G("(p259!=1)"))))))))
Formula 0 simplified : !G("(p133!=1)" | X("(p259!=1)" U ("((p133!=1)&&(p259!=1))" | G"(p259!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t7, t34, t41, t44, t47, t51, t54, t57, t60, t64, t68, t71, t74, t77, t82, t83, t85, t88, t90, t94, t97, t98, t101, t102, t105, t109, t113, t117, t118, t121, t122, t127, t128, t133, t137, t138, t140, t141, t143, t146, t148, t149, t182, t184, t185, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/124/45/169
Computing Next relation with stutter on 18 deadlock states
Detected timeout of ITS tools.
[2021-05-09 06:42:04] [INFO ] Flatten gal took : 25 ms
[2021-05-09 06:42:04] [INFO ] Applying decomposition
[2021-05-09 06:42:04] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph730714955542950329.txt, -o, /tmp/graph730714955542950329.bin, -w, /tmp/graph730714955542950329.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph730714955542950329.bin, -l, -1, -v, -w, /tmp/graph730714955542950329.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 06:42:04] [INFO ] Decomposing Gal with order
[2021-05-09 06:42:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 06:42:04] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-09 06:42:04] [INFO ] Flatten gal took : 50 ms
[2021-05-09 06:42:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 14 ms.
[2021-05-09 06:42:04] [INFO ] Time to serialize gal into /tmp/LTL9789799573949396996.gal : 5 ms
[2021-05-09 06:42:04] [INFO ] Time to serialize properties into /tmp/LTL16023796589925750837.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9789799573949396996.gal, -t, CGAL, -LTL, /tmp/LTL16023796589925750837.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9789799573949396996.gal -t CGAL -LTL /tmp/LTL16023796589925750837.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(("(i16.u44.p133!=1)")||(X(("(i18.u68.p259!=1)")U(("((i16.u44.p133!=1)&&(i18.u68.p259!=1))")||(G("(i18.u68.p259!=1)"))))))))
Formula 0 simplified : !G("(i16.u44.p133!=1)" | X("(i18.u68.p259!=1)" U ("((i16.u44.p133!=1)&&(i18.u68.p259!=1))" | G"(i18.u68.p259!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t102, t122, t128, t138, t143, t182, t185, u6.t149, i0.t98, i0.u24.t109, i0.u28.t101, i1.t118, i1.u18.t121, i2.u7.t148, i2.u12.t137, i3.u8.t146, i3.u40.t90, i4.u10.t141, i4.u11.t140, i5.i0.u14.t133, i5.i1.u49.t64, i5.i1.u50.t60, i6.u16.t127, i7.u20.t117, i8.i0.u22.t113, i8.i1.u51.t57, i8.i1.u52.t54, i9.i0.u26.t105, i9.i1.u55.t44, i9.i1.u56.t41, i11.i0.u32.t94, i11.i1.u30.t97, i12.u53.t51, i12.u54.t47, i13.u47.t71, i13.u48.t68, i14.u45.t77, i14.u46.t74, i16.t82, i16.u41.t88, i16.u42.t85, i16.u44.t83, i18.t7, i18.u58.t34, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/123/44/167
Computing Next relation with stutter on 18 deadlock states
95 unique states visited
0 strongly connected components in search stack
144 transitions explored
49 items max in DFS search stack
69 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.715987,45584,1,0,70930,384,2508,89419,176,1102,160070
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-03-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-03-08 finished in 17715 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Graph (trivial) has 126 edges and 228 vertex of which 6 / 228 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.
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 36 place count 222 transition count 150
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 187 transition count 150
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 71 place count 187 transition count 109
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 163 place count 136 transition count 109
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 179 place count 120 transition count 93
Iterating global reduction 2 with 16 rules applied. Total rules applied 195 place count 120 transition count 93
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 1 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 113 rules applied. Total rules applied 308 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 309 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 310 place count 61 transition count 36
Applied a total of 310 rules in 34 ms. Remains 61 /228 variables (removed 167) and now considering 36/192 (removed 156) transitions.
// Phase 1: matrix 36 rows 61 cols
[2021-05-09 06:42:05] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-09 06:42:05] [INFO ] Implicit Places using invariants in 46 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
[2021-05-09 06:42:05] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2021-05-09 06:42:05] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, iteration 1 : 60/228 places, 36/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2021-05-09 06:42:05] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2021-05-09 06:42:05] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/228 places, 36/192 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-09 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 211 transition count 175
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 211 transition count 175
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 203 transition count 167
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 203 transition count 167
Applied a total of 50 rules in 11 ms. Remains 203 /228 variables (removed 25) and now considering 167/192 (removed 25) transitions.
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:42:05] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:05] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2021-05-09 06:42:05] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:05] [INFO ] Implicit Places using invariants and state equation in 139 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
[2021-05-09 06:42:05] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/228 places, 167/192 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s199 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 71 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-11 finished in 404 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Graph (trivial) has 127 edges and 228 vertex of which 6 / 228 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.
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 37 place count 222 transition count 149
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 186 transition count 149
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 73 place count 186 transition count 107
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 167 place count 134 transition count 107
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 184 place count 117 transition count 90
Iterating global reduction 2 with 17 rules applied. Total rules applied 201 place count 117 transition count 90
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 309 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 310 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 311 place count 60 transition count 36
Applied a total of 311 rules in 20 ms. Remains 60 /228 variables (removed 168) and now considering 36/192 (removed 156) transitions.
// Phase 1: matrix 36 rows 60 cols
[2021-05-09 06:42:05] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:42:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 36 rows 60 cols
[2021-05-09 06:42:05] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 86 ms to find 12 implicit places.
[2021-05-09 06:42:05] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 36 rows 48 cols
[2021-05-09 06:42:05] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-09 06:42:05] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 48/228 places, 36/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2021-05-09 06:42:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 36 rows 48 cols
[2021-05-09 06:42:05] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-09 06:42:05] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 48/228 places, 36/192 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-12 finished in 209 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 210 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 210 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 202 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 202 transition count 166
Applied a total of 52 rules in 18 ms. Remains 202 /228 variables (removed 26) and now considering 166/192 (removed 26) transitions.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:42:06] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:42:06] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 202 cols
[2021-05-09 06:42:06] [INFO ] Computed 41 place invariants in 1 ms
[2021-05-09 06:42:06] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 202/228 places, 166/192 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-03-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s23 0), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-13 finished in 400 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 227 transition count 160
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 196 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 66 place count 194 transition count 158
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 66 place count 194 transition count 111
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 170 place count 137 transition count 111
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 188 place count 119 transition count 93
Iterating global reduction 3 with 18 rules applied. Total rules applied 206 place count 119 transition count 93
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 316 place count 63 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 63 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 318 place count 62 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 319 place count 61 transition count 37
Applied a total of 319 rules in 19 ms. Remains 61 /228 variables (removed 167) and now considering 37/192 (removed 155) transitions.
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:42:06] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 37 rows 61 cols
[2021-05-09 06:42:06] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 21 places :
Implicit Place search using SMT with State Equation took 102 ms to find 21 implicit places.
[2021-05-09 06:42:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 37 rows 40 cols
[2021-05-09 06:42:06] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 40/228 places, 37/192 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 40 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 34 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 31 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 31 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 31 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 29 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 26 transition count 23
Applied a total of 28 rules in 6 ms. Remains 26 /40 variables (removed 14) and now considering 23/37 (removed 14) transitions.
// Phase 1: matrix 23 rows 26 cols
[2021-05-09 06:42:06] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 23 rows 26 cols
[2021-05-09 06:42:06] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 26/228 places, 23/192 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s21 1) (EQ s25 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 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-14 finished in 242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((F(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 192/192 transitions.
Graph (trivial) has 123 edges and 228 vertex of which 6 / 228 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 222 transition count 151
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 188 transition count 151
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 69 place count 188 transition count 111
Deduced a syphon composed of 40 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 89 rules applied. Total rules applied 158 place count 139 transition count 111
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 173 place count 124 transition count 96
Iterating global reduction 2 with 15 rules applied. Total rules applied 188 place count 124 transition count 96
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 302 place count 66 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 65 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 64 transition count 39
Applied a total of 304 rules in 17 ms. Remains 64 /228 variables (removed 164) and now considering 39/192 (removed 153) transitions.
// Phase 1: matrix 39 rows 64 cols
[2021-05-09 06:42:06] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
[2021-05-09 06:42:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 39 rows 63 cols
[2021-05-09 06:42:06] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 63/228 places, 39/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2021-05-09 06:42:06] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 39 rows 63 cols
[2021-05-09 06:42:06] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-09 06:42:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 63/228 places, 39/192 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-15 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s26 1) (EQ s55 0)), p0:(EQ s26 1), p2:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-15 finished in 255 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620542527135

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143700341"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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