Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 11 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 63K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716650248278

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-03
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 15:17:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 15:17:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:17:31] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-25 15:17:31] [INFO ] Transformed 274 places.
[2024-05-25 15:17:31] [INFO ] Transformed 237 transitions.
[2024-05-25 15:17:31] [INFO ] Found NUPN structural information;
[2024-05-25 15:17:31] [INFO ] Parsed PT model containing 274 places and 237 transitions and 632 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 236
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 233 transition count 197
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 233 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 233 transition count 196
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 217 transition count 180
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 217 transition count 180
Applied a total of 112 rules in 99 ms. Remains 217 /273 variables (removed 56) and now considering 180/236 (removed 56) transitions.
// Phase 1: matrix 180 rows 217 cols
[2024-05-25 15:17:32] [INFO ] Computed 42 invariants in 20 ms
[2024-05-25 15:17:32] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-25 15:17:32] [INFO ] Invariant cache hit.
[2024-05-25 15:17:33] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2024-05-25 15:17:33] [INFO ] Invariant cache hit.
[2024-05-25 15:17:33] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/273 places, 180/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1691 ms. Remains : 217/273 places, 180/236 transitions.
Support contains 33 out of 217 places after structural reductions.
[2024-05-25 15:17:33] [INFO ] Flatten gal took : 74 ms
[2024-05-25 15:17:33] [INFO ] Flatten gal took : 43 ms
[2024-05-25 15:17:34] [INFO ] Input system was already deterministic with 180 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-25 15:17:34] [INFO ] Invariant cache hit.
[2024-05-25 15:17:34] [INFO ] [Real]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-25 15:17:34] [INFO ] [Real]Absence check using 30 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-25 15:17:34] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-25 15:17:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-25 15:17:35] [INFO ] [Nat]Absence check using 30 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-25 15:17:35] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-25 15:17:35] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 30 ms to minimize.
[2024-05-25 15:17:36] [INFO ] Deduced a trap composed of 11 places in 1142 ms of which 1 ms to minimize.
[2024-05-25 15:17:38] [INFO ] Deduced a trap composed of 18 places in 1661 ms of which 2 ms to minimize.
[2024-05-25 15:17:38] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 2 ms to minimize.
[2024-05-25 15:17:40] [INFO ] Deduced a trap composed of 20 places in 2282 ms of which 33 ms to minimize.
[2024-05-25 15:17:40] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-05-25 15:17:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5557 ms
[2024-05-25 15:17:40] [INFO ] After 5769ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-25 15:17:40] [INFO ] After 6035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 98 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 5 ms.
Computed a total of 210 stabilizing places and 172 stable transitions
Graph (complete) has 453 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 114 edges and 217 vertex of which 6 / 217 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.
Graph (complete) has 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 209 transition count 146
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 54 place count 183 transition count 146
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 54 place count 183 transition count 106
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 142 place count 135 transition count 106
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 150 place count 127 transition count 98
Iterating global reduction 2 with 8 rules applied. Total rules applied 158 place count 127 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 127 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 126 transition count 97
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 279 place count 66 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 65 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 281 place count 64 transition count 37
Applied a total of 281 rules in 59 ms. Remains 64 /217 variables (removed 153) and now considering 37/180 (removed 143) transitions.
// Phase 1: matrix 37 rows 64 cols
[2024-05-25 15:17:41] [INFO ] Computed 31 invariants in 1 ms
[2024-05-25 15:17:41] [INFO ] Implicit Places using invariants in 63 ms returned [1, 13, 53]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/217 places, 37/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 61/217 places, 37/180 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s56 1)), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22219 reset in 367 ms.
Product exploration explored 100000 steps with 22287 reset in 184 ms.
Computed a total of 61 stabilizing places and 36 stable transitions
Computed a total of 61 stabilizing places and 36 stable transitions
Detected a total of 61/61 stabilizing places and 36/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 165 steps, including 50 resets, run visited all 2 properties in 11 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 37/37 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 37/37 (removed 0) transitions.
// Phase 1: matrix 37 rows 61 cols
[2024-05-25 15:17:43] [INFO ] Computed 28 invariants in 0 ms
[2024-05-25 15:17:43] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-25 15:17:43] [INFO ] Invariant cache hit.
[2024-05-25 15:17:43] [INFO ] Implicit Places using invariants and state equation in 241 ms returned [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 313 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/61 places, 37/37 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 33 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 28 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 26 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 26 transition count 30
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 26 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 25 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 24 place count 21 transition count 25
Applied a total of 24 rules in 7 ms. Remains 21 /33 variables (removed 12) and now considering 25/37 (removed 12) transitions.
// Phase 1: matrix 25 rows 21 cols
[2024-05-25 15:17:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 15:17:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 15:17:43] [INFO ] Invariant cache hit.
[2024-05-25 15:17:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/61 places, 25/37 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 21/61 places, 25/37 transitions.
Computed a total of 21 stabilizing places and 24 stable transitions
Computed a total of 21 stabilizing places and 24 stable transitions
Detected a total of 21/21 stabilizing places and 24/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 238 steps, including 74 resets, run visited all 2 properties in 5 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 458 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24143 reset in 115 ms.
Product exploration explored 100000 steps with 24201 reset in 108 ms.
Built C files in :
/tmp/ltsmin4163158606558464251
[2024-05-25 15:17:45] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-25 15:17:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:45] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-25 15:17:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:45] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-25 15:17:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 15:17:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4163158606558464251
Running compilation step : cd /tmp/ltsmin4163158606558464251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin4163158606558464251;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin4163158606558464251;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9772813789139619867.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-03-LTLCardinality-00 finished in 4418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 62 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-25 15:17:45] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 15:17:45] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-25 15:17:45] [INFO ] Invariant cache hit.
[2024-05-25 15:17:46] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
[2024-05-25 15:17:46] [INFO ] Invariant cache hit.
[2024-05-25 15:17:46] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-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: 2}]], initial=3, aps=[p0:(OR (EQ s68 0) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1109 steps with 12 reset in 6 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-01 finished in 1163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 17 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
[2024-05-25 15:17:46] [INFO ] Invariant cache hit.
[2024-05-25 15:17:47] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-25 15:17:47] [INFO ] Invariant cache hit.
[2024-05-25 15:17:47] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-25 15:17:47] [INFO ] Invariant cache hit.
[2024-05-25 15:17:47] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 537 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s106 0) (EQ s65 1)), p0:(OR (EQ s97 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-02 finished in 805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 203 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 203 transition count 167
Applied a total of 27 rules in 10 ms. Remains 203 /217 variables (removed 14) and now considering 167/180 (removed 13) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-25 15:17:47] [INFO ] Computed 41 invariants in 4 ms
[2024-05-25 15:17:47] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-25 15:17:47] [INFO ] Invariant cache hit.
[2024-05-25 15:17:49] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1333 ms to find 0 implicit places.
[2024-05-25 15:17:49] [INFO ] Invariant cache hit.
[2024-05-25 15:17:49] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/217 places, 167/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1465 ms. Remains : 203/217 places, 167/180 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-03 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:(OR (EQ s51 0) (EQ s24 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 4014 steps with 49 reset in 10 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-03 finished in 1618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 206 transition count 170
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 206 transition count 170
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 202 transition count 166
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 202 transition count 166
Applied a total of 29 rules in 11 ms. Remains 202 /217 variables (removed 15) and now considering 166/180 (removed 14) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-25 15:17:49] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:17:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-25 15:17:49] [INFO ] Invariant cache hit.
[2024-05-25 15:17:49] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-25 15:17:49] [INFO ] Invariant cache hit.
[2024-05-25 15:17:49] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/217 places, 166/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 202/217 places, 166/180 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s88 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 175 ms.
Product exploration explored 100000 steps with 33333 reset in 128 ms.
Computed a total of 196 stabilizing places and 158 stable transitions
Graph (complete) has 429 edges and 202 vertex of which 201 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 196 stabilizing places and 158 stable transitions
Detected a total of 196/202 stabilizing places and 158/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-03-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-03-LTLCardinality-05 finished in 1024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)||p0))&&F(G(p2))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 113 edges and 217 vertex of which 6 / 217 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 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 210 transition count 148
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 185 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 184 transition count 147
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 54 place count 184 transition count 107
Deduced a syphon composed of 40 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 143 place count 135 transition count 107
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 151 place count 127 transition count 99
Iterating global reduction 3 with 8 rules applied. Total rules applied 159 place count 127 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 159 place count 127 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 126 transition count 98
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 3 with 114 rules applied. Total rules applied 275 place count 68 transition count 42
Applied a total of 275 rules in 32 ms. Remains 68 /217 variables (removed 149) and now considering 42/180 (removed 138) transitions.
// Phase 1: matrix 42 rows 68 cols
[2024-05-25 15:17:50] [INFO ] Computed 30 invariants in 0 ms
[2024-05-25 15:17:50] [INFO ] Implicit Places using invariants in 76 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/217 places, 42/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 67/217 places, 42/180 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s57 0) (EQ s1 1)), p1:(AND (EQ s13 0) (EQ s46 1)), p2:(EQ s3 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 98 steps with 10 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-06 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F((p1||G(p0))))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 203 transition count 167
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 203 transition count 167
Applied a total of 27 rules in 7 ms. Remains 203 /217 variables (removed 14) and now considering 167/180 (removed 13) transitions.
// Phase 1: matrix 167 rows 203 cols
[2024-05-25 15:17:50] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:17:50] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-25 15:17:50] [INFO ] Invariant cache hit.
[2024-05-25 15:17:51] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-25 15:17:51] [INFO ] Invariant cache hit.
[2024-05-25 15:17:51] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/217 places, 167/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 203/217 places, 167/180 transitions.
Stuttering acceptance computed with spot in 263 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s154 0), p1:(AND (EQ s127 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-07 finished in 853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 110 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 446 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 210 transition count 148
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 50 place count 186 transition count 148
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 50 place count 186 transition count 105
Deduced a syphon composed of 43 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 133 transition count 105
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 154 place count 125 transition count 97
Iterating global reduction 2 with 8 rules applied. Total rules applied 162 place count 125 transition count 97
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 278 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 279 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 280 place count 64 transition count 39
Applied a total of 280 rules in 18 ms. Remains 64 /217 variables (removed 153) and now considering 39/180 (removed 141) transitions.
// Phase 1: matrix 39 rows 64 cols
[2024-05-25 15:17:51] [INFO ] Computed 29 invariants in 0 ms
[2024-05-25 15:17:53] [INFO ] Implicit Places using invariants in 1594 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 12, 13]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 1595 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/217 places, 39/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1615 ms. Remains : 53/217 places, 39/180 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 0) (EQ s1 1)), p1:(AND (EQ s48 0) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-10 finished in 1742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(G(p2))))'
Support contains 3 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 209 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 209 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 207 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 207 transition count 171
Applied a total of 19 rules in 15 ms. Remains 207 /217 variables (removed 10) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 207 cols
[2024-05-25 15:17:53] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 15:17:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-25 15:17:53] [INFO ] Invariant cache hit.
[2024-05-25 15:17:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-05-25 15:17:53] [INFO ] Invariant cache hit.
[2024-05-25 15:17:53] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/217 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 415 ms. Remains : 207/217 places, 171/180 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s202 1), p2:(EQ s185 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-11 finished in 685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 217 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Graph (trivial) has 115 edges and 217 vertex of which 6 / 217 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 446 edges and 212 vertex of which 210 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 209 transition count 146
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 183 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 182 transition count 145
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 56 place count 182 transition count 104
Deduced a syphon composed of 41 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 147 place count 132 transition count 104
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 155 place count 124 transition count 96
Iterating global reduction 3 with 8 rules applied. Total rules applied 163 place count 124 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 163 place count 124 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 165 place count 123 transition count 95
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 283 place count 63 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 284 place count 62 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 285 place count 61 transition count 36
Applied a total of 285 rules in 39 ms. Remains 61 /217 variables (removed 156) and now considering 36/180 (removed 144) transitions.
// Phase 1: matrix 36 rows 61 cols
[2024-05-25 15:17:53] [INFO ] Computed 29 invariants in 1 ms
[2024-05-25 15:17:54] [INFO ] Implicit Places using invariants in 56 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/217 places, 36/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 60/217 places, 36/180 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-03-LTLCardinality-14 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(p1&&(G(p0) U G(p2))))))'
Support contains 5 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 216 transition count 180
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 207 transition count 171
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 207 transition count 171
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 204 transition count 168
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 204 transition count 168
Applied a total of 25 rules in 10 ms. Remains 204 /217 variables (removed 13) and now considering 168/180 (removed 12) transitions.
// Phase 1: matrix 168 rows 204 cols
[2024-05-25 15:17:54] [INFO ] Computed 41 invariants in 2 ms
[2024-05-25 15:17:54] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-25 15:17:54] [INFO ] Invariant cache hit.
[2024-05-25 15:17:54] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-25 15:17:54] [INFO ] Invariant cache hit.
[2024-05-25 15:17:54] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/217 places, 168/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 204/217 places, 168/180 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(OR (EQ s0 0) (EQ s89 1)), p0:(EQ s109 1), p1:(OR (EQ s129 0) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1186 reset in 334 ms.
Product exploration explored 100000 steps with 1184 reset in 255 ms.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 432 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 626 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p0) p1 p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), true, (X (X p2)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 653 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
[2024-05-25 15:17:57] [INFO ] Invariant cache hit.
[2024-05-25 15:17:57] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2024-05-25 15:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:58] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-25 15:17:58] [INFO ] Computed and/alt/rep : 166/292/166 causal constraints (skipped 1 transitions) in 13 ms.
[2024-05-25 15:17:58] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 204 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Applied a total of 0 rules in 13 ms. Remains 204 /204 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-25 15:17:58] [INFO ] Invariant cache hit.
[2024-05-25 15:17:58] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-25 15:17:58] [INFO ] Invariant cache hit.
[2024-05-25 15:17:58] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-25 15:17:58] [INFO ] Invariant cache hit.
[2024-05-25 15:17:58] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 204/204 places, 168/168 transitions.
Computed a total of 198 stabilizing places and 160 stable transitions
Graph (complete) has 432 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 198 stabilizing places and 160 stable transitions
Detected a total of 198/204 stabilizing places and 160/168 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
[2024-05-25 15:17:59] [INFO ] Invariant cache hit.
[2024-05-25 15:17:59] [INFO ] [Real]Absence check using 41 positive place invariants in 19 ms returned sat
[2024-05-25 15:17:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 15:17:59] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-25 15:18:00] [INFO ] Computed and/alt/rep : 166/292/166 causal constraints (skipped 1 transitions) in 18 ms.
[2024-05-25 15:18:00] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 1178 reset in 242 ms.
Product exploration explored 100000 steps with 1171 reset in 187 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Graph (trivial) has 104 edges and 204 vertex of which 6 / 204 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 199 transition count 162
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 29 Pre rules applied. Total rules applied 25 place count 199 transition count 188
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 54 place count 199 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 191 transition count 173
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 191 transition count 173
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 0 ms
Iterating global reduction 1 with 73 rules applied. Total rules applied 143 place count 191 transition count 173
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 159 place count 175 transition count 157
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 175 place count 175 transition count 157
Deduced a syphon composed of 102 places in 0 ms
Applied a total of 175 rules in 74 ms. Remains 175 /204 variables (removed 29) and now considering 157/168 (removed 11) transitions.
[2024-05-25 15:18:01] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 157 rows 175 cols
[2024-05-25 15:18:01] [INFO ] Computed 41 invariants in 3 ms
[2024-05-25 15:18:01] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 175/204 places, 157/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 324 ms. Remains : 175/204 places, 157/168 transitions.
Built C files in :
/tmp/ltsmin1428764847789440824
[2024-05-25 15:18:01] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1428764847789440824
Running compilation step : cd /tmp/ltsmin1428764847789440824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 293 ms.
Running link step : cd /tmp/ltsmin1428764847789440824;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1428764847789440824;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10491254591142343059.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 204/204 places, 168/168 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 203 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 203 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 202 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 202 transition count 166
Applied a total of 4 rules in 35 ms. Remains 202 /204 variables (removed 2) and now considering 166/168 (removed 2) transitions.
// Phase 1: matrix 166 rows 202 cols
[2024-05-25 15:18:16] [INFO ] Computed 41 invariants in 1 ms
[2024-05-25 15:18:17] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-25 15:18:17] [INFO ] Invariant cache hit.
[2024-05-25 15:18:17] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-25 15:18:17] [INFO ] Invariant cache hit.
[2024-05-25 15:18:17] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/204 places, 166/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 202/204 places, 166/168 transitions.
Built C files in :
/tmp/ltsmin6902723919102541670
[2024-05-25 15:18:17] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6902723919102541670
Running compilation step : cd /tmp/ltsmin6902723919102541670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin6902723919102541670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6902723919102541670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17321910390636019475.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 15:18:32] [INFO ] Flatten gal took : 15 ms
[2024-05-25 15:18:32] [INFO ] Flatten gal took : 14 ms
[2024-05-25 15:18:32] [INFO ] Time to serialize gal into /tmp/LTL5221542141453210529.gal : 4 ms
[2024-05-25 15:18:32] [INFO ] Time to serialize properties into /tmp/LTL15013316152746744106.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5221542141453210529.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5389210189541363959.hoa' '-atoms' '/tmp/LTL15013316152746744106.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15013316152746744106.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5389210189541363959.hoa
Reverse transition relation is NOT exact ! Due to transitions t27, t34, t37, t40, t43, t47, t50, t53, t56, t59, t62, t65, t69, t72, t75, t78, t80, t83, t86...402
Computing Next relation with stutter on 18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:18:47] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:18:47] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:18:47] [INFO ] Time to serialize gal into /tmp/LTL9176729750921835414.gal : 3 ms
[2024-05-25 15:18:47] [INFO ] Time to serialize properties into /tmp/LTL5914562495326558821.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9176729750921835414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5914562495326558821.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(p120==1)")||(((G("(p120==1)"))U(G("((p0==0)||(p100==1))")))&&("((p145==0)||(p207==1))")))))
Formula 0 simplified : X(!"(p120==1)" & (!"((p145==0)||(p207==1))" | (F!"(p120==1)" R F!"((p0==0)||(p100==1))")))
Reverse transition relation is NOT exact ! Due to transitions t24, t27, t34, t37, t40, t43, t47, t50, t53, t56, t59, t62, t65, t69, t72, t75, t78, t80, t83...407
Computing Next relation with stutter on 18 deadlock states
Detected timeout of ITS tools.
[2024-05-25 15:19:02] [INFO ] Flatten gal took : 10 ms
[2024-05-25 15:19:02] [INFO ] Applying decomposition
[2024-05-25 15:19:02] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10424950742735082478.txt' '-o' '/tmp/graph10424950742735082478.bin' '-w' '/tmp/graph10424950742735082478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10424950742735082478.bin' '-l' '-1' '-v' '-w' '/tmp/graph10424950742735082478.weights' '-q' '0' '-e' '0.001'
[2024-05-25 15:19:03] [INFO ] Decomposing Gal with order
[2024-05-25 15:19:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 15:19:03] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-25 15:19:03] [INFO ] Flatten gal took : 113 ms
[2024-05-25 15:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-25 15:19:03] [INFO ] Time to serialize gal into /tmp/LTL14251213566278244116.gal : 13 ms
[2024-05-25 15:19:03] [INFO ] Time to serialize properties into /tmp/LTL11429071478682655930.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14251213566278244116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11429071478682655930.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(("(i15.u40.p120==1)")||(((G("(i15.u40.p120==1)"))U(G("((i1.i0.u0.p0==0)||(i1.i0.u33.p100==1))")))&&("((i14.u45.p145==0)||(i17.u58...171
Formula 0 simplified : X(!"(i15.u40.p120==1)" & (!"((i14.u45.p145==0)||(i17.u58.p207==1))" | (F!"(i15.u40.p120==1)" R F!"((i1.i0.u0.p0==0)||(i1.i0.u33.p100...164
Reverse transition relation is NOT exact ! Due to transitions t91, t107, t116, t124, t131, t170, t172, t173, t176, u7.t137, i0.u52.t43, i0.u53.t40, i0.u54....666
Computing Next relation with stutter on 18 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
74 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.788269,44668,1,0,66083,367,2545,90958,168,1044,163527
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-03-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-03-LTLCardinality-15 finished in 70233 ms.
All properties solved by simple procedures.
Total runtime 93056 ms.

BK_STOP 1716650344639

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BusinessProcesses-PT-03, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r065-tajo-171620414800292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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