Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678361107452

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:25:09] [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]
[2023-03-09 11:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:25:09] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 11:25:09] [INFO ] Transformed 403 places.
[2023-03-09 11:25:09] [INFO ] Transformed 374 transitions.
[2023-03-09 11:25:09] [INFO ] Found NUPN structural information;
[2023-03-09 11:25:09] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 53 place count 350 transition count 322
Iterating global reduction 1 with 52 rules applied. Total rules applied 105 place count 350 transition count 322
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 122 place count 333 transition count 305
Iterating global reduction 1 with 17 rules applied. Total rules applied 139 place count 333 transition count 305
Applied a total of 139 rules in 86 ms. Remains 333 /403 variables (removed 70) and now considering 305/374 (removed 69) transitions.
// Phase 1: matrix 305 rows 333 cols
[2023-03-09 11:25:09] [INFO ] Computed 64 place invariants in 21 ms
[2023-03-09 11:25:10] [INFO ] Implicit Places using invariants in 268 ms returned []
[2023-03-09 11:25:10] [INFO ] Invariant cache hit.
[2023-03-09 11:25:10] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-09 11:25:10] [INFO ] Invariant cache hit.
[2023-03-09 11:25:10] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 333/403 places, 305/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 333/403 places, 305/374 transitions.
Support contains 33 out of 333 places after structural reductions.
[2023-03-09 11:25:10] [INFO ] Flatten gal took : 52 ms
[2023-03-09 11:25:10] [INFO ] Flatten gal took : 20 ms
[2023-03-09 11:25:10] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 28 out of 333 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-09 11:25:11] [INFO ] Invariant cache hit.
[2023-03-09 11:25:12] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-09 11:25:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-09 11:25:12] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-09 11:25:12] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-09 11:25:12] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 22 ms to minimize.
[2023-03-09 11:25:12] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2023-03-09 11:25:12] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2023-03-09 11:25:12] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2023-03-09 11:25:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 355 ms
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 0 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 0 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 0 ms to minimize.
[2023-03-09 11:25:13] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 0 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 0 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 0 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1450 ms
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 0 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-09 11:25:14] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-09 11:25:15] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2023-03-09 11:25:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-03-09 11:25:15] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 0 ms to minimize.
[2023-03-09 11:25:15] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2023-03-09 11:25:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-09 11:25:15] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2023-03-09 11:25:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-09 11:25:15] [INFO ] After 3005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 127 ms.
[2023-03-09 11:25:15] [INFO ] After 3353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 40 ms.
Support contains 10 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 142 edges and 333 vertex of which 4 / 333 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 767 edges and 330 vertex of which 329 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output 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 329 transition count 274
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 303 transition count 272
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 301 transition count 272
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 58 place count 301 transition count 205
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 200 place count 226 transition count 205
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 206 place count 220 transition count 199
Iterating global reduction 3 with 6 rules applied. Total rules applied 212 place count 220 transition count 199
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 373 place count 138 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 375 place count 137 transition count 123
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 377 place count 137 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 379 place count 135 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 380 place count 134 transition count 120
Applied a total of 380 rules in 67 ms. Remains 134 /333 variables (removed 199) and now considering 120/305 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 134/333 places, 120/305 transitions.
Finished random walk after 8513 steps, including 707 resets, run visited all 5 properties in 49 ms. (steps per millisecond=173 )
FORMULA BusinessProcesses-PT-09-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 200 stabilizing places and 202 stable transitions
Graph (complete) has 771 edges and 333 vertex of which 332 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(p0))))))'
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 324 transition count 296
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 324 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 20 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-09 11:25:15] [INFO ] Computed 64 place invariants in 11 ms
[2023-03-09 11:25:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-09 11:25:16] [INFO ] Invariant cache hit.
[2023-03-09 11:25:16] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-09 11:25:16] [INFO ] Invariant cache hit.
[2023-03-09 11:25:16] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (EQ s309 0) (EQ s66 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 1847 steps with 19 reset in 17 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-00 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 326 transition count 264
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 293 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 292 transition count 263
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 70 place count 292 transition count 195
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 216 place count 214 transition count 195
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 226 place count 204 transition count 185
Iterating global reduction 3 with 10 rules applied. Total rules applied 236 place count 204 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 236 place count 204 transition count 184
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 238 place count 203 transition count 184
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 395 place count 123 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 397 place count 122 transition count 110
Applied a total of 397 rules in 56 ms. Remains 122 /333 variables (removed 211) and now considering 110/305 (removed 195) transitions.
// Phase 1: matrix 110 rows 122 cols
[2023-03-09 11:25:17] [INFO ] Computed 51 place invariants in 2 ms
[2023-03-09 11:25:17] [INFO ] Implicit Places using invariants in 87 ms returned [1, 2, 3, 37, 38, 39, 40, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 90 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/333 places, 110/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 112 /112 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 154 ms. Remains : 112/333 places, 110/305 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s46 0) (EQ s9 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 40 steps with 6 reset in 1 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-01 finished in 205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 317 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 317 transition count 289
Applied a total of 32 rules in 43 ms. Remains 317 /333 variables (removed 16) and now considering 289/305 (removed 16) transitions.
// Phase 1: matrix 289 rows 317 cols
[2023-03-09 11:25:17] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-09 11:25:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-09 11:25:17] [INFO ] Invariant cache hit.
[2023-03-09 11:25:17] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-09 11:25:17] [INFO ] Invariant cache hit.
[2023-03-09 11:25:17] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/333 places, 289/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 317/333 places, 289/305 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s276 0) (EQ s227 1)), p1:(AND (EQ s100 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1477 reset in 233 ms.
Stack based approach found an accepted trace after 783 steps with 13 reset with depth 13 and stack size 13 in 2 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-06 finished in 957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p2)&&p1))||p0)))'
Support contains 6 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 327 transition count 299
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 327 transition count 299
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 325 transition count 297
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 325 transition count 297
Applied a total of 16 rules in 18 ms. Remains 325 /333 variables (removed 8) and now considering 297/305 (removed 8) transitions.
// Phase 1: matrix 297 rows 325 cols
[2023-03-09 11:25:18] [INFO ] Computed 64 place invariants in 10 ms
[2023-03-09 11:25:18] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-09 11:25:18] [INFO ] Invariant cache hit.
[2023-03-09 11:25:18] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-09 11:25:18] [INFO ] Invariant cache hit.
[2023-03-09 11:25:18] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 325/333 places, 297/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 325/333 places, 297/305 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s80 0) (EQ s288 1) (EQ s67 0) (EQ s4 1)), p1:(AND (EQ s4 0) (EQ s67 1)), p2:(OR (AND (EQ s288 0) (EQ s80 1)) (AND (EQ s318 0) (EQ s254 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][false, false, false, false]]
Product exploration explored 100000 steps with 1044 reset in 309 ms.
Product exploration explored 100000 steps with 1041 reset in 212 ms.
Computed a total of 195 stabilizing places and 197 stable transitions
Graph (complete) has 759 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 195 stabilizing places and 197 stable transitions
Detected a total of 195/325 stabilizing places and 197/297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 11:25:20] [INFO ] Invariant cache hit.
[2023-03-09 11:25:20] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:25:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-09 11:25:20] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 12 ms returned sat
[2023-03-09 11:25:20] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 0 ms to minimize.
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2023-03-09 11:25:20] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 0 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 1 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 1 ms to minimize.
[2023-03-09 11:25:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1308 ms
[2023-03-09 11:25:21] [INFO ] After 1470ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 11:25:21] [INFO ] After 1590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 143 edges and 325 vertex of which 6 / 325 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 752 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 319 transition count 259
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 289 transition count 259
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 62 place count 289 transition count 192
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 206 place count 212 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 211 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 211 transition count 191
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 371 place count 128 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 373 place count 127 transition count 114
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 127 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 377 place count 125 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 378 place count 125 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 379 place count 124 transition count 111
Applied a total of 379 rules in 39 ms. Remains 124 /325 variables (removed 201) and now considering 111/297 (removed 186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 124/325 places, 111/297 transitions.
Incomplete random walk after 10000 steps, including 549 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 219 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1353975 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :{}
Probabilistic random walk after 1353975 steps, saw 456324 distinct states, run finished after 3004 ms. (steps per millisecond=450 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 124 cols
[2023-03-09 11:25:24] [INFO ] Computed 51 place invariants in 4 ms
[2023-03-09 11:25:24] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:25:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-09 11:25:24] [INFO ] [Nat]Absence check using 34 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-09 11:25:24] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:25:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:25:24] [INFO ] After 9ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:25:24] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-09 11:25:24] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 7 factoid took 401 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Applied a total of 0 rules in 4 ms. Remains 325 /325 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 325 cols
[2023-03-09 11:25:25] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 11:25:25] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-09 11:25:25] [INFO ] Invariant cache hit.
[2023-03-09 11:25:26] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-09 11:25:26] [INFO ] Invariant cache hit.
[2023-03-09 11:25:26] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 325/325 places, 297/297 transitions.
Computed a total of 195 stabilizing places and 197 stable transitions
Graph (complete) has 759 edges and 325 vertex of which 324 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 195 stabilizing places and 197 stable transitions
Detected a total of 195/325 stabilizing places and 197/297 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 108 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 11:25:27] [INFO ] Invariant cache hit.
[2023-03-09 11:25:27] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:25:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-09 11:25:27] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-09 11:25:27] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:25:27] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 0 ms to minimize.
[2023-03-09 11:25:27] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 0 ms to minimize.
[2023-03-09 11:25:27] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2023-03-09 11:25:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 350 ms
[2023-03-09 11:25:27] [INFO ] After 551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-09 11:25:27] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 140 edges and 325 vertex of which 6 / 325 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 752 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 319 transition count 260
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 290 transition count 260
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 60 place count 290 transition count 194
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 202 place count 214 transition count 194
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 365 place count 131 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 130 transition count 117
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 369 place count 130 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 371 place count 128 transition count 115
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 372 place count 128 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 373 place count 127 transition count 114
Applied a total of 373 rules in 41 ms. Remains 127 /325 variables (removed 198) and now considering 114/297 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 127/325 places, 114/297 transitions.
Incomplete random walk after 10000 steps, including 529 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 114 rows 127 cols
[2023-03-09 11:25:28] [INFO ] Computed 51 place invariants in 3 ms
[2023-03-09 11:25:28] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 11:25:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 11:25:28] [INFO ] [Nat]Absence check using 34 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-09 11:25:28] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 11:25:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:25:28] [INFO ] After 11ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 11:25:28] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 11:25:28] [INFO ] After 157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 114/114 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 126 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 126 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 125 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 124 transition count 111
Applied a total of 6 rules in 10 ms. Remains 124 /127 variables (removed 3) and now considering 111/114 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 124/127 places, 111/114 transitions.
Finished random walk after 871 steps, including 53 resets, run visited all 1 properties in 4 ms. (steps per millisecond=217 )
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (AND p1 (NOT p2))), (F p1)]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 1043 reset in 197 ms.
Product exploration explored 100000 steps with 1063 reset in 233 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Graph (trivial) has 140 edges and 325 vertex of which 6 / 325 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 753 edges and 320 vertex of which 319 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 319 transition count 290
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 31 place count 319 transition count 320
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 79 place count 319 transition count 320
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 309 transition count 301
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 309 transition count 301
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 1 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 196 place count 309 transition count 301
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 220 place count 285 transition count 277
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 244 place count 285 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 245 place count 285 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 246 place count 284 transition count 289
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 247 place count 284 transition count 289
Deduced a syphon composed of 140 places in 0 ms
Applied a total of 247 rules in 87 ms. Remains 284 /325 variables (removed 41) and now considering 289/297 (removed 8) transitions.
[2023-03-09 11:25:30] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 289 rows 284 cols
[2023-03-09 11:25:30] [INFO ] Computed 64 place invariants in 3 ms
[2023-03-09 11:25:30] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 284/325 places, 289/297 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 284/325 places, 289/297 transitions.
Built C files in :
/tmp/ltsmin10879362106644767124
[2023-03-09 11:25:30] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10879362106644767124
Running compilation step : cd /tmp/ltsmin10879362106644767124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 726 ms.
Running link step : cd /tmp/ltsmin10879362106644767124;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin10879362106644767124;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15562821309322540694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 325 /325 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 325 cols
[2023-03-09 11:25:45] [INFO ] Computed 64 place invariants in 5 ms
[2023-03-09 11:25:45] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-09 11:25:45] [INFO ] Invariant cache hit.
[2023-03-09 11:25:45] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-09 11:25:45] [INFO ] Invariant cache hit.
[2023-03-09 11:25:46] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 325/325 places, 297/297 transitions.
Built C files in :
/tmp/ltsmin10842990207509186510
[2023-03-09 11:25:46] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10842990207509186510
Running compilation step : cd /tmp/ltsmin10842990207509186510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 469 ms.
Running link step : cd /tmp/ltsmin10842990207509186510;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10842990207509186510;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15728821530925086533.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:26:01] [INFO ] Flatten gal took : 20 ms
[2023-03-09 11:26:01] [INFO ] Flatten gal took : 17 ms
[2023-03-09 11:26:01] [INFO ] Time to serialize gal into /tmp/LTL6671424408707287262.gal : 3 ms
[2023-03-09 11:26:01] [INFO ] Time to serialize properties into /tmp/LTL5702169432288553821.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6671424408707287262.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9277102285534735564.hoa' '-atoms' '/tmp/LTL5702169432288553821.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5702169432288553821.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9277102285534735564.hoa
Detected timeout of ITS tools.
[2023-03-09 11:26:16] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:26:16] [INFO ] Flatten gal took : 13 ms
[2023-03-09 11:26:16] [INFO ] Time to serialize gal into /tmp/LTL3767484553511572752.gal : 10 ms
[2023-03-09 11:26:16] [INFO ] Time to serialize properties into /tmp/LTL52280502909842889.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3767484553511572752.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL52280502909842889.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...273
Read 1 LTL properties
Checking formula 0 : !((G(("(((p93==0)||(p366==1))||((p71==0)||(p4==1)))")||(X(("((p4==0)&&(p71==1))")&&(F("(((p366==0)&&(p93==1))||((p396==0)&&(p293==1)))...163
Formula 0 simplified : F(!"(((p93==0)||(p366==1))||((p71==0)||(p4==1)))" & X(!"((p4==0)&&(p71==1))" | G!"(((p366==0)&&(p93==1))||((p396==0)&&(p293==1)))"))
Detected timeout of ITS tools.
[2023-03-09 11:26:31] [INFO ] Flatten gal took : 36 ms
[2023-03-09 11:26:31] [INFO ] Applying decomposition
[2023-03-09 11:26:31] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1557488778295115305.txt' '-o' '/tmp/graph1557488778295115305.bin' '-w' '/tmp/graph1557488778295115305.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1557488778295115305.bin' '-l' '-1' '-v' '-w' '/tmp/graph1557488778295115305.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:26:31] [INFO ] Decomposing Gal with order
[2023-03-09 11:26:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:26:31] [INFO ] Removed a total of 220 redundant transitions.
[2023-03-09 11:26:31] [INFO ] Flatten gal took : 70 ms
[2023-03-09 11:26:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2023-03-09 11:26:31] [INFO ] Time to serialize gal into /tmp/LTL17345913276440152814.gal : 21 ms
[2023-03-09 11:26:31] [INFO ] Time to serialize properties into /tmp/LTL6083267417121457343.ltl : 0 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17345913276440152814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6083267417121457343.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(("(((i15.u30.p93==0)||(i14.u100.p366==1))||((i5.u26.p71==0)||(i0.u2.p4==1)))")||(X(("((i0.u2.p4==0)&&(i5.u26.p71==1))")&&(F("(((i...245
Formula 0 simplified : F(!"(((i15.u30.p93==0)||(i14.u100.p366==1))||((i5.u26.p71==0)||(i0.u2.p4==1)))" & X(!"((i0.u2.p4==0)&&(i5.u26.p71==1))" | G!"(((i14....237
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t7, t8, t9, t10, t120, t144, t166, t181, t187, t197, t224, t228, t286, t288, t295...853
Computing Next relation with stutter on 301440 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7853111654849469066
[2023-03-09 11:26:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7853111654849469066
Running compilation step : cd /tmp/ltsmin7853111654849469066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 616 ms.
Running link step : cd /tmp/ltsmin7853111654849469066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7853111654849469066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((<>((LTLAPp2==true))&&(LTLAPp1==true)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-09-LTLCardinality-08 finished in 103791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 327 transition count 265
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 294 transition count 265
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 67 place count 294 transition count 197
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 213 place count 216 transition count 197
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 222 place count 207 transition count 188
Iterating global reduction 2 with 9 rules applied. Total rules applied 231 place count 207 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 231 place count 207 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 233 place count 206 transition count 187
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 163 rules applied. Total rules applied 396 place count 123 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 398 place count 122 transition count 110
Applied a total of 398 rules in 46 ms. Remains 122 /333 variables (removed 211) and now considering 110/305 (removed 195) transitions.
// Phase 1: matrix 110 rows 122 cols
[2023-03-09 11:27:02] [INFO ] Computed 51 place invariants in 1 ms
[2023-03-09 11:27:02] [INFO ] Implicit Places using invariants in 97 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 99 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/333 places, 110/305 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 111/333 places, 110/305 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 18818 reset in 221 ms.
Product exploration explored 100000 steps with 19149 reset in 175 ms.
Computed a total of 68 stabilizing places and 82 stable transitions
Graph (complete) has 478 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 68 stabilizing places and 82 stable transitions
Detected a total of 68/111 stabilizing places and 82/110 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 9 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 111 cols
[2023-03-09 11:27:02] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-09 11:27:02] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 11:27:02] [INFO ] Invariant cache hit.
[2023-03-09 11:27:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:27:03] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [10, 38, 58, 60, 66, 68]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 185 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/111 places, 110/110 transitions.
Graph (complete) has 397 edges and 105 vertex of which 96 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 95 transition count 105
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 85 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 85 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 84 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 84 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 82 transition count 64
Applied a total of 29 rules in 8 ms. Remains 82 /105 variables (removed 23) and now considering 64/110 (removed 46) transitions.
// Phase 1: matrix 64 rows 82 cols
[2023-03-09 11:27:03] [INFO ] Computed 29 place invariants in 1 ms
[2023-03-09 11:27:03] [INFO ] Implicit Places using invariants in 49 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/111 places, 64/110 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 250 ms. Remains : 79/111 places, 64/110 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 252 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 36 stabilizing places and 36 stable transitions
Detected a total of 36/79 stabilizing places and 36/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 69 steps, including 19 resets, run visited all 1 properties in 5 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19372 reset in 134 ms.
Product exploration explored 100000 steps with 19363 reset in 107 ms.
Built C files in :
/tmp/ltsmin5649847357765132549
[2023-03-09 11:27:03] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2023-03-09 11:27:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:27:03] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2023-03-09 11:27:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:27:03] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2023-03-09 11:27:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:27:03] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5649847357765132549
Running compilation step : cd /tmp/ltsmin5649847357765132549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 156 ms.
Running link step : cd /tmp/ltsmin5649847357765132549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5649847357765132549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2162233241419937884.hoa' '--buchi-type=spotba'
LTSmin run took 5743 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-09-LTLCardinality-09 finished in 7887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 155 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 35 place count 326 transition count 264
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 293 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 292 transition count 263
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 70 place count 292 transition count 195
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 216 place count 214 transition count 195
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 225 place count 205 transition count 186
Iterating global reduction 3 with 9 rules applied. Total rules applied 234 place count 205 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 205 transition count 185
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 236 place count 204 transition count 185
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 397 place count 122 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 121 transition count 109
Applied a total of 399 rules in 42 ms. Remains 121 /333 variables (removed 212) and now considering 109/305 (removed 196) transitions.
// Phase 1: matrix 109 rows 121 cols
[2023-03-09 11:27:09] [INFO ] Computed 51 place invariants in 2 ms
[2023-03-09 11:27:10] [INFO ] Implicit Places using invariants in 126 ms returned [1, 2, 3, 11, 36, 37, 38, 41, 42, 43]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 128 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/333 places, 109/305 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 111/333 places, 109/305 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s33 0) (NEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-10 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 318 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 21 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-09 11:27:10] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-09 11:27:10] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 11:27:10] [INFO ] Invariant cache hit.
[2023-03-09 11:27:10] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2023-03-09 11:27:10] [INFO ] Invariant cache hit.
[2023-03-09 11:27:10] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s250 1), p1:(OR (EQ s285 0) (EQ s248 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Computed a total of 189 stabilizing places and 191 stable transitions
Graph (complete) has 749 edges and 318 vertex of which 317 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 189 stabilizing places and 191 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 8 factoid took 195 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-09-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-09-LTLCardinality-11 finished in 1431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&F(p2)&&p0)))'
Support contains 4 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 324 transition count 296
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 324 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 318 transition count 290
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 318 transition count 290
Applied a total of 30 rules in 26 ms. Remains 318 /333 variables (removed 15) and now considering 290/305 (removed 15) transitions.
// Phase 1: matrix 290 rows 318 cols
[2023-03-09 11:27:11] [INFO ] Computed 64 place invariants in 2 ms
[2023-03-09 11:27:11] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 11:27:11] [INFO ] Invariant cache hit.
[2023-03-09 11:27:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-09 11:27:11] [INFO ] Invariant cache hit.
[2023-03-09 11:27:12] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 318/333 places, 290/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 318/333 places, 290/305 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (EQ s244 0) (EQ s255 1)), p2:(OR (EQ s313 0) (EQ s257 1)), p0:(AND (EQ s257 0) (EQ s313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-12 finished in 808 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 323 transition count 295
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 323 transition count 295
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 317 transition count 289
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 317 transition count 289
Applied a total of 32 rules in 20 ms. Remains 317 /333 variables (removed 16) and now considering 289/305 (removed 16) transitions.
// Phase 1: matrix 289 rows 317 cols
[2023-03-09 11:27:12] [INFO ] Computed 64 place invariants in 4 ms
[2023-03-09 11:27:12] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-09 11:27:12] [INFO ] Invariant cache hit.
[2023-03-09 11:27:12] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-09 11:27:12] [INFO ] Invariant cache hit.
[2023-03-09 11:27:12] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 317/333 places, 289/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 317/333 places, 289/305 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s146 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-09-LTLCardinality-13 finished in 760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p2)&&p1))||p0)))'
Found a Lengthening insensitive property : BusinessProcesses-PT-09-LTLCardinality-08
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 6 out of 333 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 333/333 places, 305/305 transitions.
Graph (trivial) has 148 edges and 333 vertex of which 6 / 333 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 765 edges and 328 vertex of which 327 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 326 transition count 267
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 296 transition count 267
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 62 place count 296 transition count 200
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 206 place count 219 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 212 place count 213 transition count 194
Iterating global reduction 2 with 6 rules applied. Total rules applied 218 place count 213 transition count 194
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 161 rules applied. Total rules applied 379 place count 131 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 130 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 129 transition count 117
Applied a total of 382 rules in 44 ms. Remains 129 /333 variables (removed 204) and now considering 117/305 (removed 188) transitions.
// Phase 1: matrix 117 rows 129 cols
[2023-03-09 11:27:13] [INFO ] Computed 51 place invariants in 2 ms
[2023-03-09 11:27:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-09 11:27:13] [INFO ] Invariant cache hit.
[2023-03-09 11:27:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-09 11:27:13] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [53, 73, 75, 81, 83]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 280 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/333 places, 117/305 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 123 transition count 116
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 2 with 6 rules applied. Total rules applied 8 place count 120 transition count 113
Applied a total of 8 rules in 6 ms. Remains 120 /124 variables (removed 4) and now considering 113/117 (removed 4) transitions.
// Phase 1: matrix 113 rows 120 cols
[2023-03-09 11:27:13] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-09 11:27:13] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-09 11:27:13] [INFO ] Invariant cache hit.
[2023-03-09 11:27:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 11:27:13] [INFO ] Implicit Places using invariants and state equation in 180 ms returned [17, 42, 44, 45]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 299 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 116/333 places, 113/305 transitions.
Graph (complete) has 435 edges and 116 vertex of which 107 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 99 transition count 77
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 99 transition count 77
Applied a total of 17 rules in 5 ms. Remains 99 /116 variables (removed 17) and now considering 77/113 (removed 36) transitions.
// Phase 1: matrix 77 rows 99 cols
[2023-03-09 11:27:13] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 11:27:14] [INFO ] Implicit Places using invariants in 73 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 97/333 places, 77/305 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 727 ms. Remains : 97/333 places, 77/305 transitions.
Running random walk in product with property : BusinessProcesses-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s17 0) (EQ s71 1) (EQ s14 0) (EQ s1 1)), p1:(AND (EQ s1 0) (EQ s14 1)), p2:(OR (AND (EQ s71 0) (EQ s17 1)) (AND (EQ s92 0) (EQ s60 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2651 steps with 382 reset in 6 ms.
Treatment of property BusinessProcesses-PT-09-LTLCardinality-08 finished in 1021 ms.
FORMULA BusinessProcesses-PT-09-LTLCardinality-08 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 11:27:14] [INFO ] Flatten gal took : 16 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 124783 ms.

BK_STOP 1678361234354

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690500515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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