Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531600091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 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 StigmergyCommit-PT-02a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717227770210

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:42:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:42:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:42:51] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-01 07:42:51] [INFO ] Transformed 112 places.
[2024-06-01 07:42:51] [INFO ] Transformed 204 transitions.
[2024-06-01 07:42:51] [INFO ] Found NUPN structural information;
[2024-06-01 07:42:51] [INFO ] Parsed PT model containing 112 places and 204 transitions and 693 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-02a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 159/159 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 90 transition count 134
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 90 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 90 transition count 131
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 53 place count 84 transition count 124
Iterating global reduction 1 with 6 rules applied. Total rules applied 59 place count 84 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 84 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 83 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 83 transition count 121
Applied a total of 63 rules in 29 ms. Remains 83 /112 variables (removed 29) and now considering 121/159 (removed 38) transitions.
[2024-06-01 07:42:51] [INFO ] Flow matrix only has 117 transitions (discarded 4 similar events)
// Phase 1: matrix 117 rows 83 cols
[2024-06-01 07:42:51] [INFO ] Computed 2 invariants in 15 ms
[2024-06-01 07:42:51] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-01 07:42:51] [INFO ] Flow matrix only has 117 transitions (discarded 4 similar events)
[2024-06-01 07:42:51] [INFO ] Invariant cache hit.
[2024-06-01 07:42:51] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 07:42:51] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 326 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/112 places, 121/159 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 77 transition count 116
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 77 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 77 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 75 transition count 112
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 75 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 74 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 74 transition count 111
Applied a total of 18 rules in 8 ms. Remains 74 /82 variables (removed 8) and now considering 111/121 (removed 10) transitions.
[2024-06-01 07:42:51] [INFO ] Flow matrix only has 107 transitions (discarded 4 similar events)
// Phase 1: matrix 107 rows 74 cols
[2024-06-01 07:42:51] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:42:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:42:51] [INFO ] Flow matrix only has 107 transitions (discarded 4 similar events)
[2024-06-01 07:42:51] [INFO ] Invariant cache hit.
[2024-06-01 07:42:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:42:52] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 74/112 places, 111/159 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 470 ms. Remains : 74/112 places, 111/159 transitions.
Support contains 25 out of 74 places after structural reductions.
[2024-06-01 07:42:52] [INFO ] Flatten gal took : 28 ms
[2024-06-01 07:42:52] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:42:52] [INFO ] Input system was already deterministic with 111 transitions.
Support contains 23 out of 74 places (down from 25) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 5207 steps (27 resets) in 218 ms. (23 steps per ms) remains 0/16 properties
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 64 transition count 99
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 64 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 64 transition count 98
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 29 place count 56 transition count 90
Iterating global reduction 1 with 8 rules applied. Total rules applied 37 place count 56 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 50 transition count 84
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 50 transition count 83
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 46 transition count 79
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 46 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 44 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 44 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 43 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 43 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 43 transition count 74
Applied a total of 66 rules in 21 ms. Remains 43 /74 variables (removed 31) and now considering 74/111 (removed 37) transitions.
[2024-06-01 07:42:52] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
// Phase 1: matrix 70 rows 43 cols
[2024-06-01 07:42:52] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 07:42:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:42:52] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2024-06-01 07:42:52] [INFO ] Invariant cache hit.
[2024-06-01 07:42:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:42:52] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2024-06-01 07:42:52] [INFO ] Flow matrix only has 70 transitions (discarded 4 similar events)
[2024-06-01 07:42:52] [INFO ] Invariant cache hit.
[2024-06-01 07:42:52] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 7 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 2 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 69/112 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-06-01 07:42:53] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 73 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 69/112 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 73/145 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 146 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1411 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 13/13 constraints]
After SMT, in 3491ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3503ms
Starting structural reductions in LTL mode, iteration 1 : 43/74 places, 74/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3606 ms. Remains : 43/74 places, 74/111 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-00 finished in 3891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 73 transition count 73
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 80 place count 36 transition count 67
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 34 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 82 place count 34 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 30 transition count 63
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 28 transition count 60
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 28 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 28 transition count 59
Performed 9 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 113 place count 19 transition count 47
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 118 place count 19 transition count 42
Performed 4 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 126 place count 15 transition count 45
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 137 place count 15 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 147 place count 15 transition count 24
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 15 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 150 place count 15 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 13 transition count 21
Applied a total of 152 rules in 23 ms. Remains 13 /74 variables (removed 61) and now considering 21/111 (removed 90) transitions.
[2024-06-01 07:42:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-06-01 07:42:56] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:42:56] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:42:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-06-01 07:42:56] [INFO ] Invariant cache hit.
[2024-06-01 07:42:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:42:56] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 07:42:56] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 07:42:56] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2024-06-01 07:42:56] [INFO ] Invariant cache hit.
[2024-06-01 07:42:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 17/30 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/31 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/31 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/31 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 24 constraints, problems are : Problem set: 0 solved, 13 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:42:56] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 17/30 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 38 constraints, problems are : Problem set: 0 solved, 13 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 10/10 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 458ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/74 places, 21/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 525 ms. Remains : 13/74 places, 21/111 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-01 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G((!p1||X(!p2)))||(F(!p3)&&(!p1||X(!p2)))))&&p0)))'
Support contains 6 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 65 transition count 101
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 65 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 65 transition count 100
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 59 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 59 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 59 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 54 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 54 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 54 transition count 87
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 45 place count 52 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 52 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 51 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 51 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 50 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 50 transition count 82
Applied a total of 52 rules in 9 ms. Remains 50 /74 variables (removed 24) and now considering 82/111 (removed 29) transitions.
[2024-06-01 07:42:57] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
// Phase 1: matrix 78 rows 50 cols
[2024-06-01 07:42:57] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:42:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 07:42:57] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2024-06-01 07:42:57] [INFO ] Invariant cache hit.
[2024-06-01 07:42:57] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:42:57] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-06-01 07:42:57] [INFO ] Flow matrix only has 78 transitions (discarded 4 similar events)
[2024-06-01 07:42:57] [INFO ] Invariant cache hit.
[2024-06-01 07:42:57] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 2 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 23 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 4 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:42:57] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 77/127 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2175 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 77/127 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 81/163 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 07:43:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 165 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2616 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 17/17 constraints]
After SMT, in 4821ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 4824ms
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 82/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4892 ms. Remains : 50/74 places, 82/111 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), true, (AND p1 p2), p2, (AND p1 p3 p2), (AND p3 p2), p3]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-02 finished in 5221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)||p0))&&(p2 U (p3||G(p4)))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 67 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 67 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 67 transition count 101
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 61 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 61 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 61 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 59 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 59 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 58 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 58 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 57 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 57 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 56 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 56 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 56 transition count 88
Applied a total of 39 rules in 17 ms. Remains 56 /74 variables (removed 18) and now considering 88/111 (removed 23) transitions.
[2024-06-01 07:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
// Phase 1: matrix 84 rows 56 cols
[2024-06-01 07:43:02] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:43:02] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2024-06-01 07:43:02] [INFO ] Invariant cache hit.
[2024-06-01 07:43:02] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-01 07:43:02] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2024-06-01 07:43:02] [INFO ] Flow matrix only has 84 transitions (discarded 4 similar events)
[2024-06-01 07:43:02] [INFO ] Invariant cache hit.
[2024-06-01 07:43:02] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:43:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 27 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
[2024-06-01 07:43:03] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 83/139 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 87 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 83/139 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 87/173 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 174 constraints, problems are : Problem set: 0 solved, 87 unsolved in 1957 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 14/14 constraints]
After SMT, in 4576ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 4577ms
Starting structural reductions in LTL mode, iteration 1 : 56/74 places, 88/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4660 ms. Remains : 56/74 places, 88/111 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p4), (AND (NOT p3) (NOT p4)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-03
Product exploration explored 100000 steps with 2 reset in 132 ms.
Product exploration explored 100000 steps with 0 reset in 93 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Detected a total of 12/56 stabilizing places and 12/88 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p4 (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) p4 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p3) p4 (NOT p2))), (X p4), (X (NOT (AND (NOT p3) (NOT p4) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p4) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p4 p2)))), (X (X p1)), (X (X (AND (NOT p3) p4 (NOT p2)))), (X (X p4)), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p4) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 201 ms. Reduced automaton from 6 states, 15 edges and 5 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p4)]
RANDOM walk for 2042 steps (12 resets) in 13 ms. (145 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p3) p4 (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND (NOT p3) p4 p2))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p3) p4 (NOT p2))), (X p4), (X (NOT (AND (NOT p3) (NOT p4) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p4) p2))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p4 p2)))), (X (X p1)), (X (X (AND (NOT p3) p4 (NOT p2)))), (X (X p4)), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p4) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p4))]
Property proved to be false thanks to negative knowledge :(F (NOT p4))
Knowledge based reduction with 22 factoid took 235 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-02a-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-03 finished in 5649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 73 transition count 72
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 83 place count 35 transition count 65
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 34 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 33 transition count 63
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 87 place count 33 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 97 place count 28 transition count 58
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 26 transition count 54
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 26 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 26 transition count 51
Performed 10 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 124 place count 16 transition count 38
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 131 place count 16 transition count 31
Performed 3 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 137 place count 13 transition count 32
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 144 place count 13 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 150 place count 13 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 11 transition count 17
Applied a total of 152 rules in 11 ms. Remains 11 /74 variables (removed 63) and now considering 17/111 (removed 94) transitions.
[2024-06-01 07:43:07] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 07:43:07] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:43:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:43:08] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:08] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:43:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 07:43:08] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 07:43:08] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:08] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 13/24 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 16 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 13/24 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 40 constraints, problems are : Problem set: 0 solved, 16 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 447ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/74 places, 17/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 11/74 places, 17/111 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-06 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 74 transition count 72
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 84 place count 35 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 34 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 85 place count 34 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 95 place count 29 transition count 61
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 27 transition count 57
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 27 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 27 transition count 54
Performed 13 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 128 place count 14 transition count 36
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 135 place count 14 transition count 29
Performed 3 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 11 transition count 30
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 148 place count 11 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 154 place count 11 transition count 17
Applied a total of 154 rules in 12 ms. Remains 11 /74 variables (removed 63) and now considering 17/111 (removed 94) transitions.
[2024-06-01 07:43:08] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-06-01 07:43:08] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:43:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:43:08] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:08] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:43:08] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 07:43:08] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 07:43:08] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:08] [INFO ] Invariant cache hit.
[2024-06-01 07:43:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 13/24 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 26 constraints, problems are : Problem set: 0 solved, 16 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 07:43:08] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 13/24 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/25 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/25 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 43 constraints, problems are : Problem set: 0 solved, 16 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
After SMT, in 477ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/74 places, 17/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 11/74 places, 17/111 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-12 finished in 586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&G(p1)) U (F(p2) U p3))))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 73 transition count 79
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 42 transition count 76
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 41 transition count 71
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 77 place count 37 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 77 place count 37 transition count 63
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 89 place count 31 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 29 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 29 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 96 place count 29 transition count 56
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 112 place count 21 transition count 47
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 119 place count 21 transition count 40
Performed 3 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 125 place count 18 transition count 41
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 132 place count 18 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 138 place count 18 transition count 28
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 141 place count 18 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 142 place count 18 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 144 place count 16 transition count 25
Applied a total of 144 rules in 10 ms. Remains 16 /74 variables (removed 58) and now considering 25/111 (removed 86) transitions.
[2024-06-01 07:43:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-06-01 07:43:09] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:43:09] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:43:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:09] [INFO ] Invariant cache hit.
[2024-06-01 07:43:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:43:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 07:43:09] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:43:09] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:09] [INFO ] Invariant cache hit.
[2024-06-01 07:43:09] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 21/37 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 30 constraints, problems are : Problem set: 0 solved, 24 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 21/37 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 24/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/38 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 55 constraints, problems are : Problem set: 0 solved, 24 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 11/11 constraints]
After SMT, in 695ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/74 places, 25/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 16/74 places, 25/111 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (NOT p3)]
Running random walk in product with property : StigmergyCommit-PT-02a-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 101 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/16 stabilizing places and 2/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X p2), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))))), (X p0), (X (NOT (AND (NOT p3) p0 p1))), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 180 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 5 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[(NOT p3), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p1)), (NOT p3)]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (4028 resets) in 354 ms. (112 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (1235 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1157 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1207 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1175 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1172 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
[2024-06-01 07:43:11] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:11] [INFO ] Invariant cache hit.
[2024-06-01 07:43:11] [INFO ] State equation strengthened by 3 read => feed constraints.
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/37 variables, 16/17 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 2/19 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 20 constraints, problems are : Problem set: 4 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:43:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem apf6 is UNSAT
After SMT solving in domain Int declared 16/38 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/16 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 106ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 (NOT p0) p1), (X p3), (X (NOT (AND (NOT p3) (NOT p2) p0 p1))), (X p2), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1))))), (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1))))), (X p0), (X (NOT (AND (NOT p3) p0 p1))), (X p1), (X (NOT (AND (NOT p2) p1))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p1)))))), (X (X (NOT (OR (AND (NOT p3) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) p0 p1)))), (X (X p1)), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) p2)), (G (OR (NOT p0) (NOT p1) p3)), (G (AND (OR p0 p2 p3) (OR p1 p2 p3))), (G (OR (NOT p0) (NOT p1) p2 p3)), (G (OR p2 p3))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p3) (OR p1 p3)))), (F (NOT p2)), (F (NOT p3)), (F (NOT p1)), (F p0), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 29 factoid took 480 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p3), (NOT p3)]
Support contains 2 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-06-01 07:43:11] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:11] [INFO ] Invariant cache hit.
[2024-06-01 07:43:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 07:43:11] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:11] [INFO ] Invariant cache hit.
[2024-06-01 07:43:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:43:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 07:43:11] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2024-06-01 07:43:11] [INFO ] Flow matrix only has 22 transitions (discarded 3 similar events)
[2024-06-01 07:43:11] [INFO ] Invariant cache hit.
[2024-06-01 07:43:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 1/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 21/37 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 30 constraints, problems are : Problem set: 0 solved, 24 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-06-01 07:43:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 21/37 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 24/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 1/38 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 55 constraints, problems are : Problem set: 0 solved, 24 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 16/16 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 11/11 constraints]
After SMT, in 716ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 768 ms. Remains : 16/16 places, 25/25 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 78 ms :[(NOT p3), (NOT p3)]
RANDOM walk for 247 steps (28 resets) in 5 ms. (41 steps per ms) remains 0/1 properties
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 102 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 78 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 33 ms.
Product exploration explored 100000 steps with 0 reset in 37 ms.
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 25/25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 22
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 11 transition count 20
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 11 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 11 transition count 19
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 3 with 2 rules applied. Total rules applied 11 place count 10 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 10 transition count 17
Applied a total of 12 rules in 2 ms. Remains 10 /16 variables (removed 6) and now considering 17/25 (removed 8) transitions.
[2024-06-01 07:43:13] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-06-01 07:43:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:43:13] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 07:43:13] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:13] [INFO ] Invariant cache hit.
[2024-06-01 07:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 07:43:13] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 07:43:13] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 07:43:13] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2024-06-01 07:43:13] [INFO ] Invariant cache hit.
[2024-06-01 07:43:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 13/23 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 12 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 3/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:43:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 13/23 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/24 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/24 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/24 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 32 constraints, problems are : Problem set: 0 solved, 12 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 8/8 constraints]
After SMT, in 378ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16 places, 17/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 10/16 places, 17/25 transitions.
Treatment of property StigmergyCommit-PT-02a-LTLCardinality-13 finished in 4556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0&&G(p1)) U (F(p2) U p3))))'
[2024-06-01 07:43:13] [INFO ] Flatten gal took : 10 ms
[2024-06-01 07:43:13] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:43:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 111 transitions and 296 arcs took 2 ms.
Total runtime 22653 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-02a-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717227794133

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-02a-LTLCardinality-13
ltl formula formula --ltl=/tmp/1248/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 74 places, 111 transitions and 296 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 76 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 75, there are 120 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 440
pnml2lts-mc( 0/ 4): unique states count: 651
pnml2lts-mc( 0/ 4): unique transitions count: 1856
pnml2lts-mc( 0/ 4): - self-loop count: 118
pnml2lts-mc( 0/ 4): - claim dead count: 719
pnml2lts-mc( 0/ 4): - claim found count: 427
pnml2lts-mc( 0/ 4): - claim success count: 729
pnml2lts-mc( 0/ 4): - cum. max stack depth: 127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 740 states 2161 transitions, fanout: 2.920
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74000, Transitions per second: 216100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 11.0 B/state, compr.: 3.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 111 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="StigmergyCommit-PT-02a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyCommit-PT-02a, 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 r536-tall-171690531600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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