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.r136-tall-171631132500364.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 itstools
Input is DiscoveryGPU-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716373708155

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 10:28:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:28:29] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-22 10:28:29] [INFO ] Transformed 63 places.
[2024-05-22 10:28:29] [INFO ] Transformed 85 transitions.
[2024-05-22 10:28:29] [INFO ] Found NUPN structural information;
[2024-05-22 10:28:29] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 82
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 82
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 58 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 58 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 57 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 57 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 17 place count 57 transition count 73
Applied a total of 17 rules in 28 ms. Remains 57 /63 variables (removed 6) and now considering 73/85 (removed 12) transitions.
// Phase 1: matrix 73 rows 57 cols
[2024-05-22 10:28:29] [INFO ] Computed 2 invariants in 7 ms
[2024-05-22 10:28:29] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 10:28:29] [INFO ] Invariant cache hit.
[2024-05-22 10:28:29] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 10:28:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-22 10:28:29] [INFO ] Invariant cache hit.
[2024-05-22 10:28:29] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/130 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 105 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/130 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 46/105 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 72/177 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 177 constraints, problems are : Problem set: 0 solved, 72 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 2277ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2291ms
Starting structural reductions in LTL mode, iteration 1 : 57/63 places, 73/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2645 ms. Remains : 57/63 places, 73/85 transitions.
Support contains 23 out of 57 places after structural reductions.
[2024-05-22 10:28:32] [INFO ] Flatten gal took : 23 ms
[2024-05-22 10:28:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:28:32] [INFO ] Input system was already deterministic with 73 transitions.
RANDOM walk for 27502 steps (420 resets) in 642 ms. (42 steps per ms) remains 0/23 properties
FORMULA DiscoveryGPU-PT-06a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 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(F((p0&&(X(F(p1)) U G(p2))))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 5 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:28:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:28:33] [INFO ] Invariant cache hit.
[2024-05-22 10:28:33] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:33] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-22 10:28:33] [INFO ] Invariant cache hit.
[2024-05-22 10:28:33] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1567ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1568ms
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1680 ms. Remains : 48/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-00
Product exploration explored 100000 steps with 1531 reset in 219 ms.
Product exploration explored 100000 steps with 1533 reset in 151 ms.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 147 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 9 stabilizing places and 7 stable transitions
Detected a total of 9/48 stabilizing places and 7/64 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 305 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 412 steps (4 resets) in 9 ms. (41 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F (NOT p0)), (F p2), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 9 factoid took 599 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
[2024-05-22 10:28:36] [INFO ] Invariant cache hit.
[2024-05-22 10:28:36] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:28:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-22 10:28:36] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:36] [INFO ] [Real]Added 43 Read/Feed constraints in 10 ms returned sat
[2024-05-22 10:28:36] [INFO ] Computed and/alt/rep : 63/123/63 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-22 10:28:36] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Graph (complete) has 147 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 47 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 62
Applied a total of 3 rules in 12 ms. Remains 46 /48 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 10:28:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:28:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 10:28:36] [INFO ] Invariant cache hit.
[2024-05-22 10:28:37] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:37] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-22 10:28:37] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-22 10:28:37] [INFO ] Invariant cache hit.
[2024-05-22 10:28:37] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 91 constraints, problems are : Problem set: 0 solved, 61 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 61/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 0 solved, 61 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1373ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1374ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/48 places, 62/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1536 ms. Remains : 46/48 places, 62/64 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Computed a total of 9 stabilizing places and 7 stable transitions
Detected a total of 9/46 stabilizing places and 7/62 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 217 steps (1 resets) in 8 ms. (24 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (AND (NOT p1) p0 p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2)))))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p2) p1))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 701 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
[2024-05-22 10:28:39] [INFO ] Invariant cache hit.
[2024-05-22 10:28:40] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:28:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-22 10:28:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:40] [INFO ] [Real]Added 43 Read/Feed constraints in 2 ms returned sat
[2024-05-22 10:28:40] [INFO ] Computed and/alt/rep : 61/121/61 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:28:40] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2878 reset in 199 ms.
Product exploration explored 100000 steps with 2937 reset in 154 ms.
Built C files in :
/tmp/ltsmin16974935878565490679
[2024-05-22 10:28:40] [INFO ] Computing symmetric may disable matrix : 62 transitions.
[2024-05-22 10:28:40] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 10:28:40] [INFO ] Computing symmetric may enable matrix : 62 transitions.
[2024-05-22 10:28:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 10:28:40] [INFO ] Computing Do-Not-Accords matrix : 62 transitions.
[2024-05-22 10:28:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 10:28:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16974935878565490679
Running compilation step : cd /tmp/ltsmin16974935878565490679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 275 ms.
Running link step : cd /tmp/ltsmin16974935878565490679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin16974935878565490679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5677594174598444284.hoa' '--buchi-type=spotba'
LTSmin run took 115 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-00 finished in 8139 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)&&F(G(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 54 transition count 66
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 50 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 46 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 46 transition count 62
Applied a total of 17 rules in 11 ms. Remains 46 /57 variables (removed 11) and now considering 62/73 (removed 11) transitions.
[2024-05-22 10:28:41] [INFO ] Invariant cache hit.
[2024-05-22 10:28:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 10:28:41] [INFO ] Invariant cache hit.
[2024-05-22 10:28:41] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-22 10:28:41] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-22 10:28:41] [INFO ] Invariant cache hit.
[2024-05-22 10:28:41] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 91 constraints, problems are : Problem set: 0 solved, 61 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 61/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 0 solved, 61 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1462ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/57 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1577 ms. Remains : 46/57 places, 62/73 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-01
Stuttering criterion allowed to conclude after 119 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-01 finished in 1712 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(p0))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 5 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:28:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:28:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 10:28:42] [INFO ] Invariant cache hit.
[2024-05-22 10:28:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:42] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-22 10:28:42] [INFO ] Invariant cache hit.
[2024-05-22 10:28:42] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1449ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1450ms
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1542 ms. Remains : 48/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-02 finished in 1670 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(F(p0))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 4 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
[2024-05-22 10:28:44] [INFO ] Invariant cache hit.
[2024-05-22 10:28:44] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 10:28:44] [INFO ] Invariant cache hit.
[2024-05-22 10:28:44] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 139 ms.
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 126 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-03 finished in 513 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(F(p0))||(F(p0)&&G(p1)&&F(!p0)))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 52 vertex of which 46 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Graph (trivial) has 50 edges and 46 vertex of which 24 / 46 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 34 transition count 57
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 31 place count 27 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 24 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 24 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 21 transition count 33
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 21 transition count 33
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 18 transition count 27
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 18 transition count 27
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 15 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 15 transition count 24
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 9 transition count 17
Applied a total of 65 rules in 15 ms. Remains 9 /57 variables (removed 48) and now considering 17/73 (removed 56) transitions.
[2024-05-22 10:28:45] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-22 10:28:45] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 10:28:45] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2024-05-22 10:28:45] [INFO ] Invariant cache hit.
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-22 10:28:45] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-22 10:28:45] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
[2024-05-22 10:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/20 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/21 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 50 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 50 ms.
Refiners :[State Equation: 9/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/57 places, 17/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 9/57 places, 17/73 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-04 finished in 296 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((((X(p2) U p3)&&p1)||p0))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 67
Applied a total of 12 rules in 5 ms. Remains 51 /57 variables (removed 6) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:28:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:28:45] [INFO ] Invariant cache hit.
[2024-05-22 10:28:45] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 67/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 50/57 places, 67/73 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-07 finished in 285 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(p0))))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 7 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:28:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 10:28:45] [INFO ] Invariant cache hit.
[2024-05-22 10:28:45] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:45] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-22 10:28:45] [INFO ] Invariant cache hit.
[2024-05-22 10:28:45] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/112 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 93 constraints, problems are : Problem set: 0 solved, 63 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/112 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 43/93 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 63/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 156 constraints, problems are : Problem set: 0 solved, 63 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 1569ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 1570ms
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1704 ms. Remains : 48/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-08 finished in 1837 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((p0 U p1)))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 3 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
[2024-05-22 10:28:47] [INFO ] Invariant cache hit.
[2024-05-22 10:28:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:28:47] [INFO ] Invariant cache hit.
[2024-05-22 10:28:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:47] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 10 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-09 finished in 216 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) U X(G(!p1))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 54 transition count 70
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 49 transition count 65
Applied a total of 16 rules in 6 ms. Remains 49 /57 variables (removed 8) and now considering 65/73 (removed 8) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 10:28:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:47] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 10:28:47] [INFO ] Invariant cache hit.
[2024-05-22 10:28:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:47] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-22 10:28:47] [INFO ] Invariant cache hit.
[2024-05-22 10:28:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 94 constraints, problems are : Problem set: 0 solved, 64 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 65/114 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 43/94 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/114 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 158 constraints, problems are : Problem set: 0 solved, 64 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 1577ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 1577ms
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 65/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 49/57 places, 65/73 transitions.
Stuttering acceptance computed with spot in 184 ms :[p1, (AND p1 (NOT p0)), p1, true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-11
Entered a terminal (fully accepting) state of product in 107 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-11 finished in 1870 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 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 55 transition count 68
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 50 transition count 66
Applied a total of 11 rules in 14 ms. Remains 50 /57 variables (removed 7) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 50 cols
[2024-05-22 10:28:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 10:28:49] [INFO ] Invariant cache hit.
[2024-05-22 10:28:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/57 places, 66/73 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 37 transition count 54
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 34 transition count 48
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 34 transition count 48
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 31 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 31 transition count 42
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 28 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 28 transition count 39
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 25 transition count 33
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 25 transition count 33
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 22 transition count 30
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 22 transition count 30
Applied a total of 54 rules in 7 ms. Remains 22 /49 variables (removed 27) and now considering 30/66 (removed 36) transitions.
[2024-05-22 10:28:49] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 22 cols
[2024-05-22 10:28:49] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:28:49] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-22 10:28:49] [INFO ] Invariant cache hit.
[2024-05-22 10:28:49] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/57 places, 30/73 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 22/57 places, 30/73 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-13 finished in 296 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(p1)))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Graph (complete) has 163 edges and 57 vertex of which 54 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 54 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 50 transition count 66
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 46 transition count 62
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 46 transition count 62
Applied a total of 17 rules in 18 ms. Remains 46 /57 variables (removed 11) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 10:28:49] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 10:28:49] [INFO ] Invariant cache hit.
[2024-05-22 10:28:49] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:49] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-22 10:28:49] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-22 10:28:49] [INFO ] Invariant cache hit.
[2024-05-22 10:28:49] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/108 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 91 constraints, problems are : Problem set: 0 solved, 61 unsolved in 764 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/108 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 61/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 152 constraints, problems are : Problem set: 0 solved, 61 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1391ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/57 places, 62/73 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1505 ms. Remains : 46/57 places, 62/73 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-14
Product exploration explored 100000 steps with 1707 reset in 107 ms.
Stack based approach found an accepted trace after 176 steps with 2 reset with depth 58 and stack size 53 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-14 finished in 1715 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) U X(X(p1))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 48 transition count 64
Applied a total of 18 rules in 2 ms. Remains 48 /57 variables (removed 9) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:28:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:28:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:28:51] [INFO ] Invariant cache hit.
[2024-05-22 10:28:51] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:51] [INFO ] Implicit Places using invariants and state equation in 52 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 64/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 47/57 places, 64/73 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLFireability-15 finished in 348 ms.
All properties solved by simple procedures.
Total runtime 22570 ms.

BK_STOP 1716373731883

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631132500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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