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-167813690500547.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-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690500547
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:45 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.4K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:47 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 148K 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-13-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-13-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678362849161

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-13
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 11:54:10] [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:54:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:54:11] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-09 11:54:11] [INFO ] Transformed 593 places.
[2023-03-09 11:54:11] [INFO ] Transformed 536 transitions.
[2023-03-09 11:54:11] [INFO ] Found NUPN structural information;
[2023-03-09 11:54:11] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 87 places :
Symmetric choice reduction at 1 with 87 rule applications. Total rules 92 place count 493 transition count 441
Iterating global reduction 1 with 87 rules applied. Total rules applied 179 place count 493 transition count 441
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 222 place count 450 transition count 398
Iterating global reduction 1 with 43 rules applied. Total rules applied 265 place count 450 transition count 398
Applied a total of 265 rules in 117 ms. Remains 450 /585 variables (removed 135) and now considering 398/528 (removed 130) transitions.
// Phase 1: matrix 398 rows 450 cols
[2023-03-09 11:54:11] [INFO ] Computed 90 place invariants in 43 ms
[2023-03-09 11:54:12] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-03-09 11:54:12] [INFO ] Invariant cache hit.
[2023-03-09 11:54:12] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
[2023-03-09 11:54:12] [INFO ] Invariant cache hit.
[2023-03-09 11:54:12] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 450/585 places, 398/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1436 ms. Remains : 450/585 places, 398/528 transitions.
Support contains 14 out of 450 places after structural reductions.
[2023-03-09 11:54:13] [INFO ] Flatten gal took : 92 ms
[2023-03-09 11:54:13] [INFO ] Flatten gal took : 42 ms
[2023-03-09 11:54:13] [INFO ] Input system was already deterministic with 398 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 431 ms. (steps per millisecond=23 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 11:54:14] [INFO ] Invariant cache hit.
[2023-03-09 11:54:14] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 11:54:14] [INFO ] [Nat]Absence check using 52 positive place invariants in 199 ms returned sat
[2023-03-09 11:54:14] [INFO ] [Nat]Absence check using 52 positive and 38 generalized place invariants in 17 ms returned sat
[2023-03-09 11:54:14] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-09 11:54:15] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 6 ms to minimize.
[2023-03-09 11:54:15] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2023-03-09 11:54:15] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 13 ms to minimize.
[2023-03-09 11:54:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 301 ms
[2023-03-09 11:54:15] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-03-09 11:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-03-09 11:54:15] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-09 11:54:15] [INFO ] After 1444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 9 out of 450 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 202 edges and 450 vertex of which 6 / 450 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1022 edges and 445 vertex of which 444 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 444 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 400 transition count 346
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 90 place count 400 transition count 252
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 294 place count 290 transition count 252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 296 place count 288 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 288 transition count 250
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 534 place count 168 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 536 place count 167 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 538 place count 167 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 540 place count 165 transition count 136
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 545 place count 165 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 546 place count 164 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 547 place count 163 transition count 135
Applied a total of 547 rules in 101 ms. Remains 163 /450 variables (removed 287) and now considering 135/398 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 163/450 places, 135/398 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :4
Finished Best-First random walk after 149 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=149 )
FORMULA BusinessProcesses-PT-13-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 120 stabilizing places and 113 stable transitions
Graph (complete) has 1029 edges and 450 vertex of which 449 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 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(X((F(p0)&&G(p1))))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 395
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 395
Applied a total of 6 rules in 27 ms. Remains 447 /450 variables (removed 3) and now considering 395/398 (removed 3) transitions.
// Phase 1: matrix 395 rows 447 cols
[2023-03-09 11:54:16] [INFO ] Computed 90 place invariants in 7 ms
[2023-03-09 11:54:16] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-09 11:54:16] [INFO ] Invariant cache hit.
[2023-03-09 11:54:17] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
[2023-03-09 11:54:17] [INFO ] Invariant cache hit.
[2023-03-09 11:54:17] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/450 places, 395/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1276 ms. Remains : 447/450 places, 395/398 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=5 dest: 0}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(OR (EQ s283 0) (EQ s344 1)), p0:(EQ s367 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 191 steps with 0 reset in 3 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-00 finished in 1681 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 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 205 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 443 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 399 transition count 346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 90 place count 399 transition count 251
Deduced a syphon composed of 95 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 297 place count 287 transition count 251
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 300 place count 284 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 303 place count 284 transition count 248
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 545 place count 161 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 547 place count 160 transition count 133
Applied a total of 547 rules in 104 ms. Remains 160 /450 variables (removed 290) and now considering 133/398 (removed 265) transitions.
// Phase 1: matrix 133 rows 160 cols
[2023-03-09 11:54:17] [INFO ] Computed 69 place invariants in 3 ms
[2023-03-09 11:54:18] [INFO ] Implicit Places using invariants in 232 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 240 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/450 places, 133/398 transitions.
Applied a total of 0 rules in 10 ms. Remains 141 /141 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 354 ms. Remains : 141/450 places, 133/398 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-02 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 s59 0) (NEQ s43 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-13-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-02 finished in 437 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(p0))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 446 transition count 394
Applied a total of 8 rules in 31 ms. Remains 446 /450 variables (removed 4) and now considering 394/398 (removed 4) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 11:54:18] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-09 11:54:18] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-09 11:54:18] [INFO ] Invariant cache hit.
[2023-03-09 11:54:19] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-09 11:54:19] [INFO ] Invariant cache hit.
[2023-03-09 11:54:19] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/450 places, 394/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1142 ms. Remains : 446/450 places, 394/398 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s349 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-05 finished in 1238 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(F(p0)))'
Support contains 1 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 208 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 345
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 398 transition count 345
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 92 place count 398 transition count 248
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 303 place count 284 transition count 248
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 307 place count 280 transition count 244
Iterating global reduction 2 with 4 rules applied. Total rules applied 311 place count 280 transition count 244
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 549 place count 159 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 551 place count 158 transition count 131
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 557 place count 158 transition count 131
Applied a total of 557 rules in 72 ms. Remains 158 /450 variables (removed 292) and now considering 131/398 (removed 267) transitions.
// Phase 1: matrix 131 rows 158 cols
[2023-03-09 11:54:19] [INFO ] Computed 69 place invariants in 3 ms
[2023-03-09 11:54:19] [INFO ] Implicit Places using invariants in 298 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 312 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/450 places, 131/398 transitions.
Applied a total of 0 rules in 5 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 389 ms. Remains : 139/450 places, 131/398 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 21894 reset in 407 ms.
Product exploration explored 100000 steps with 21757 reset in 296 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2545 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5980 steps, run visited all 1 properties in 76 ms. (steps per millisecond=78 )
Probabilistic random walk after 5980 steps, saw 1820 distinct states, run finished after 76 ms. (steps per millisecond=78 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 131/131 transitions.
Applied a total of 0 rules in 9 ms. Remains 139 /139 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 139 cols
[2023-03-09 11:54:21] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-09 11:54:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 11:54:21] [INFO ] Invariant cache hit.
[2023-03-09 11:54:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:54:21] [INFO ] Implicit Places using invariants and state equation in 222 ms returned [1, 3, 7, 10, 33, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 81, 83, 85, 87, 89]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 350 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/139 places, 131/131 transitions.
Graph (complete) has 362 edges and 109 vertex of which 98 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 98 transition count 117
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 89 transition count 117
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 31 place count 77 transition count 79
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 77 transition count 79
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 77 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 75 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 74 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 74 transition count 76
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 66 place count 65 transition count 68
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 4 with 2 rules applied. Total rules applied 68 place count 64 transition count 67
Applied a total of 68 rules in 25 ms. Remains 64 /109 variables (removed 45) and now considering 67/131 (removed 64) transitions.
// Phase 1: matrix 67 rows 64 cols
[2023-03-09 11:54:21] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-09 11:54:21] [INFO ] Implicit Places using invariants in 61 ms returned [5, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/139 places, 67/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 62 /62 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 452 ms. Remains : 62/139 places, 67/131 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2596 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 767 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 925 steps, run visited all 1 properties in 14 ms. (steps per millisecond=66 )
Probabilistic random walk after 925 steps, saw 365 distinct states, run finished after 14 ms. (steps per millisecond=66 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22309 reset in 104 ms.
Product exploration explored 100000 steps with 22430 reset in 120 ms.
Built C files in :
/tmp/ltsmin10378801395873092812
[2023-03-09 11:54:22] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2023-03-09 11:54:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:54:22] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2023-03-09 11:54:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:54:22] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2023-03-09 11:54:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:54:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10378801395873092812
Running compilation step : cd /tmp/ltsmin10378801395873092812;'/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 283 ms.
Running link step : cd /tmp/ltsmin10378801395873092812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10378801395873092812;'/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/stateBased16880687659684634565.hoa' '--buchi-type=spotba'
LTSmin run took 307 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLCardinality-08 finished in 3979 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(p1)||p0)))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 446 transition count 394
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 446 transition count 394
Applied a total of 8 rules in 45 ms. Remains 446 /450 variables (removed 4) and now considering 394/398 (removed 4) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 11:54:23] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-09 11:54:23] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-09 11:54:23] [INFO ] Invariant cache hit.
[2023-03-09 11:54:24] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 910 ms to find 0 implicit places.
[2023-03-09 11:54:24] [INFO ] Invariant cache hit.
[2023-03-09 11:54:24] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/450 places, 394/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1176 ms. Remains : 446/450 places, 394/398 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s373 1) (EQ s139 0) (EQ s445 1)), p1:(AND (EQ s445 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 715 reset in 224 ms.
Product exploration explored 100000 steps with 714 reset in 207 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 407 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 73 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1148036 steps, run timeout after 3001 ms. (steps per millisecond=382 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1148036 steps, saw 169884 distinct states, run finished after 3002 ms. (steps per millisecond=382 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-09 11:54:28] [INFO ] Invariant cache hit.
[2023-03-09 11:54:29] [INFO ] [Real]Absence check using 52 positive place invariants in 18 ms returned sat
[2023-03-09 11:54:29] [INFO ] [Real]Absence check using 52 positive and 38 generalized place invariants in 11 ms returned sat
[2023-03-09 11:54:29] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 11 factoid took 453 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
[2023-03-09 11:54:29] [INFO ] Invariant cache hit.
[2023-03-09 11:54:29] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-09 11:54:29] [INFO ] Invariant cache hit.
[2023-03-09 11:54:30] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-09 11:54:30] [INFO ] Invariant cache hit.
[2023-03-09 11:54:30] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 446/446 places, 394/394 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1021 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 237 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 69 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 22429 steps, run visited all 2 properties in 198 ms. (steps per millisecond=113 )
Probabilistic random walk after 22429 steps, saw 9580 distinct states, run finished after 198 ms. (steps per millisecond=113 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 386 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 716 reset in 156 ms.
Product exploration explored 100000 steps with 717 reset in 252 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 99 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Graph (trivial) has 202 edges and 446 vertex of which 6 / 446 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 1015 edges and 441 vertex of which 440 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 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 440 transition count 387
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 67 Pre rules applied. Total rules applied 46 place count 440 transition count 434
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 1 with 67 rules applied. Total rules applied 113 place count 440 transition count 434
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 127 place count 426 transition count 408
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 141 place count 426 transition count 408
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 243 places in 0 ms
Iterating global reduction 1 with 146 rules applied. Total rules applied 287 place count 426 transition count 408
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 323 place count 390 transition count 372
Deduced a syphon composed of 207 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 359 place count 390 transition count 372
Deduced a syphon composed of 207 places in 1 ms
Applied a total of 359 rules in 97 ms. Remains 390 /446 variables (removed 56) and now considering 372/394 (removed 22) transitions.
[2023-03-09 11:54:32] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 372 rows 390 cols
[2023-03-09 11:54:32] [INFO ] Computed 90 place invariants in 4 ms
[2023-03-09 11:54:33] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 390/446 places, 372/394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 390/446 places, 372/394 transitions.
Built C files in :
/tmp/ltsmin10684600328058346954
[2023-03-09 11:54:33] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10684600328058346954
Running compilation step : cd /tmp/ltsmin10684600328058346954;'/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 596 ms.
Running link step : cd /tmp/ltsmin10684600328058346954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin10684600328058346954;'/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/stateBased12597363445298608184.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 394/394 transitions.
Applied a total of 0 rules in 16 ms. Remains 446 /446 variables (removed 0) and now considering 394/394 (removed 0) transitions.
// Phase 1: matrix 394 rows 446 cols
[2023-03-09 11:54:48] [INFO ] Computed 90 place invariants in 7 ms
[2023-03-09 11:54:48] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-09 11:54:48] [INFO ] Invariant cache hit.
[2023-03-09 11:54:49] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
[2023-03-09 11:54:49] [INFO ] Invariant cache hit.
[2023-03-09 11:54:49] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 446/446 places, 394/394 transitions.
Built C files in :
/tmp/ltsmin13248053090617810140
[2023-03-09 11:54:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13248053090617810140
Running compilation step : cd /tmp/ltsmin13248053090617810140;'/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 487 ms.
Running link step : cd /tmp/ltsmin13248053090617810140;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13248053090617810140;'/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/stateBased15651424206589616880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:55:04] [INFO ] Flatten gal took : 23 ms
[2023-03-09 11:55:04] [INFO ] Flatten gal took : 29 ms
[2023-03-09 11:55:04] [INFO ] Time to serialize gal into /tmp/LTL17743044452886516898.gal : 17 ms
[2023-03-09 11:55:04] [INFO ] Time to serialize properties into /tmp/LTL1378966992194798217.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/LTL17743044452886516898.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17183933870881790275.hoa' '-atoms' '/tmp/LTL1378966992194798217.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...319
Loading property file /tmp/LTL1378966992194798217.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17183933870881790275.hoa
Detected timeout of ITS tools.
[2023-03-09 11:55:19] [INFO ] Flatten gal took : 16 ms
[2023-03-09 11:55:19] [INFO ] Flatten gal took : 39 ms
[2023-03-09 11:55:19] [INFO ] Time to serialize gal into /tmp/LTL11095046068360732621.gal : 22 ms
[2023-03-09 11:55:19] [INFO ] Time to serialize properties into /tmp/LTL9219416606722123999.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11095046068360732621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9219416606722123999.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...276
Read 1 LTL properties
Checking formula 0 : !((G(("((p469==1)||(p161==0))")||(("(p592==1)")||(X("((p592==0)&&(p161==1))"))))))
Formula 0 simplified : F(!"((p469==1)||(p161==0))" & !"(p592==1)" & X!"((p592==0)&&(p161==1))")
Detected timeout of ITS tools.
[2023-03-09 11:55:34] [INFO ] Flatten gal took : 50 ms
[2023-03-09 11:55:34] [INFO ] Applying decomposition
[2023-03-09 11:55:34] [INFO ] Flatten gal took : 28 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/graph9106366521044304280.txt' '-o' '/tmp/graph9106366521044304280.bin' '-w' '/tmp/graph9106366521044304280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9106366521044304280.bin' '-l' '-1' '-v' '-w' '/tmp/graph9106366521044304280.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:55:35] [INFO ] Decomposing Gal with order
[2023-03-09 11:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:55:35] [INFO ] Removed a total of 266 redundant transitions.
[2023-03-09 11:55:35] [INFO ] Flatten gal took : 212 ms
[2023-03-09 11:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 26 ms.
[2023-03-09 11:55:35] [INFO ] Time to serialize gal into /tmp/LTL6854367156459335458.gal : 7 ms
[2023-03-09 11:55:35] [INFO ] Time to serialize properties into /tmp/LTL4705811224812065653.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6854367156459335458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4705811224812065653.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...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i5.i2.u128.p469==1)||(i13.i0.u54.p161==0))")||(("(i13.i0.u158.p592==1)")||(X("((i13.i0.u158.p592==0)&&(i13.i0.u54.p161==1))")...160
Formula 0 simplified : F(!"((i5.i2.u128.p469==1)||(i13.i0.u54.p161==0))" & !"(i13.i0.u158.p592==1)" & X!"((i13.i0.u158.p592==0)&&(i13.i0.u54.p161==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8963332147864131231
[2023-03-09 11:55:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8963332147864131231
Running compilation step : cd /tmp/ltsmin8963332147864131231;'/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 539 ms.
Running link step : cd /tmp/ltsmin8963332147864131231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8963332147864131231;'/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((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 102267 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 (p1||G(p0))))'
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 205 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 443 transition count 346
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 399 transition count 346
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 90 place count 399 transition count 249
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 211 rules applied. Total rules applied 301 place count 285 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 303 place count 283 transition count 247
Iterating global reduction 2 with 2 rules applied. Total rules applied 305 place count 283 transition count 247
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 543 place count 162 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 545 place count 161 transition count 134
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 160 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 547 place count 159 transition count 133
Applied a total of 547 rules in 44 ms. Remains 159 /450 variables (removed 291) and now considering 133/398 (removed 265) transitions.
// Phase 1: matrix 133 rows 159 cols
[2023-03-09 11:56:05] [INFO ] Computed 68 place invariants in 1 ms
[2023-03-09 11:56:06] [INFO ] Implicit Places using invariants in 453 ms returned [25, 48, 49, 50, 51]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 460 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/450 places, 133/398 transitions.
Applied a total of 0 rules in 4 ms. Remains 154 /154 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 508 ms. Remains : 154/450 places, 133/398 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s11 0) (EQ s114 1))) (NEQ s23 1)), p0:(NEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLCardinality-14 finished in 615 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(p1)||p0)))'
Found a Lengthening insensitive property : BusinessProcesses-PT-13-LTLCardinality-10
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 450 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 450/450 places, 398/398 transitions.
Graph (trivial) has 206 edges and 450 vertex of which 6 / 450 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 1023 edges and 445 vertex of which 444 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 443 transition count 345
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 398 transition count 345
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 92 place count 398 transition count 250
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 298 place count 287 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 302 place count 283 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 306 place count 283 transition count 246
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 542 place count 163 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 544 place count 162 transition count 134
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 550 place count 162 transition count 134
Applied a total of 550 rules in 27 ms. Remains 162 /450 variables (removed 288) and now considering 134/398 (removed 264) transitions.
// Phase 1: matrix 134 rows 162 cols
[2023-03-09 11:56:06] [INFO ] Computed 70 place invariants in 1 ms
[2023-03-09 11:56:06] [INFO ] Implicit Places using invariants in 401 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 48, 49, 50, 51, 52]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 402 ms to find 20 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 142/450 places, 134/398 transitions.
Applied a total of 0 rules in 10 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 439 ms. Remains : 142/450 places, 134/398 transitions.
Running random walk in product with property : BusinessProcesses-PT-13-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s100 1) (EQ s11 0) (EQ s141 1)), p1:(AND (EQ s141 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21927 reset in 160 ms.
Product exploration explored 100000 steps with 21866 reset in 223 ms.
Computed a total of 12 stabilizing places and 10 stable transitions
Computed a total of 12 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 394 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2502 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 768 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 780 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 772 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 761 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Probably explored full state space saw : 12947 states, properties seen :3
Probabilistic random walk after 47480 steps, saw 12947 distinct states, run finished after 132 ms. (steps per millisecond=359 ) properties seen :3
Explored full state space saw : 12947 states, properties seen :0
Exhaustive walk after 47480 steps, saw 12947 distinct states, run finished after 99 ms. (steps per millisecond=479 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 11 factoid took 718 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 134/134 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 134/134 (removed 0) transitions.
// Phase 1: matrix 134 rows 142 cols
[2023-03-09 11:56:09] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-09 11:56:09] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-09 11:56:09] [INFO ] Invariant cache hit.
[2023-03-09 11:56:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-09 11:56:09] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [1, 3, 7, 10, 34, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 60, 62, 64, 66, 68, 70, 72, 74, 82, 84, 86, 88, 90]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 328 ms to find 30 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/142 places, 134/134 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 108 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 108 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 107 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 107 transition count 127
Applied a total of 10 rules in 4 ms. Remains 107 /112 variables (removed 5) and now considering 127/134 (removed 7) transitions.
// Phase 1: matrix 127 rows 107 cols
[2023-03-09 11:56:09] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-09 11:56:09] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 11:56:09] [INFO ] Invariant cache hit.
[2023-03-09 11:56:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 11:56:09] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 107/142 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 516 ms. Remains : 107/142 places, 127/134 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Graph (complete) has 352 edges and 107 vertex of which 96 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 292 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2500 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 793 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4544 steps, run visited all 2 properties in 17 ms. (steps per millisecond=267 )
Probabilistic random walk after 4544 steps, saw 1383 distinct states, run finished after 18 ms. (steps per millisecond=252 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 21960 reset in 160 ms.
Product exploration explored 100000 steps with 21900 reset in 160 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 127/127 transitions.
Graph (complete) has 352 edges and 107 vertex of which 96 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 96 transition count 122
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 21 place count 87 transition count 86
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 30 place count 87 transition count 86
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 87 transition count 90
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 38 rules in 9 ms. Remains 87 /107 variables (removed 20) and now considering 90/127 (removed 37) transitions.
[2023-03-09 11:56:11] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 90 rows 87 cols
[2023-03-09 11:56:11] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-09 11:56:11] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/107 places, 90/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 87/107 places, 90/127 transitions.
Built C files in :
/tmp/ltsmin7548926649310182516
[2023-03-09 11:56:11] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7548926649310182516
Running compilation step : cd /tmp/ltsmin7548926649310182516;'/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 310 ms.
Running link step : cd /tmp/ltsmin7548926649310182516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin7548926649310182516;'/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/stateBased7020912424526856820.hoa' '--buchi-type=spotba'
LTSmin run took 967 ms.
Treatment of property BusinessProcesses-PT-13-LTLCardinality-10 finished in 6357 ms.
FORMULA BusinessProcesses-PT-13-LTLCardinality-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-09 11:56:12] [INFO ] Flatten gal took : 15 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 121751 ms.

BK_STOP 1678362972863

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

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