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-171631132500363.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132500363
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716373689210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202405141337
[2024-05-22 10:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 10:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:28:10] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-22 10:28:10] [INFO ] Transformed 63 places.
[2024-05-22 10:28:10] [INFO ] Transformed 85 transitions.
[2024-05-22 10:28:10] [INFO ] Found NUPN structural information;
[2024-05-22 10:28:10] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 138 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.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-14 TRUE 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 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 56 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 56 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 56 transition count 72
Applied a total of 18 rules in 27 ms. Remains 56 /63 variables (removed 7) and now considering 72/85 (removed 13) transitions.
// Phase 1: matrix 72 rows 56 cols
[2024-05-22 10:28:10] [INFO ] Computed 2 invariants in 6 ms
[2024-05-22 10:28:10] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 10:28:10] [INFO ] Invariant cache hit.
[2024-05-22 10:28:10] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-22 10:28:10] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-22 10:28:10] [INFO ] Invariant cache hit.
[2024-05-22 10:28:10] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/128 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 46/104 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 104 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/128 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 46/104 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 175 constraints, problems are : Problem set: 0 solved, 71 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 1963ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 1973ms
Starting structural reductions in LTL mode, iteration 1 : 56/63 places, 72/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2268 ms. Remains : 56/63 places, 72/85 transitions.
Support contains 23 out of 56 places after structural reductions.
[2024-05-22 10:28:12] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:28:12] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:28:13] [INFO ] Input system was already deterministic with 72 transitions.
Support contains 21 out of 56 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (608 resets) in 1089 ms. (36 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40001 steps (8 resets) in 395 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 2/2 properties
[2024-05-22 10:28:13] [INFO ] Invariant cache hit.
[2024-05-22 10:28:13] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/25 variables, 8/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/25 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/49 variables, 8/32 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/49 variables, 9/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/68 variables, 9/50 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/68 variables, 8/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/68 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 17/85 variables, 8/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 8/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 15/100 variables, 6/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/100 variables, 3/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/100 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/111 variables, 4/87 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/111 variables, 4/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/111 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/116 variables, 3/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/116 variables, 2/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/120 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/120 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/124 variables, 2/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/124 variables, 2/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/124 variables, 0/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/128 variables, 2/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/128 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 0/128 variables, 0/104 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 104 constraints, problems are : Problem set: 1 solved, 1 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 56/56 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Int declared 25/128 variables, and 16 constraints, problems are : Problem set: 2 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 12/56 constraints, ReadFeed: 2/46 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 161 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 51 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 51 transition count 67
Applied a total of 10 rules in 5 ms. Remains 51 /56 variables (removed 5) and now considering 67/72 (removed 5) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:28:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:28:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-22 10:28:13] [INFO ] Invariant cache hit.
[2024-05-22 10:28:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 67/72 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 118 ms. Remains : 50/56 places, 67/72 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-00 finished in 366 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 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Graph (complete) has 161 edges and 56 vertex of which 53 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 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 53 transition count 65
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 49 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 46 transition count 62
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 46 transition count 62
Applied a total of 15 rules in 17 ms. Remains 46 /56 variables (removed 10) and now considering 62/72 (removed 10) transitions.
// Phase 1: matrix 62 rows 46 cols
[2024-05-22 10:28:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-22 10:28:14] [INFO ] Invariant cache hit.
[2024-05-22 10:28:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants and state equation in 71 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 115 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/56 places, 62/72 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 33 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 28 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 28 transition count 40
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 24 transition count 32
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 24 transition count 32
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 20 transition count 28
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 20 transition count 28
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 16 transition count 20
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 16 transition count 20
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 13 transition count 17
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 13 transition count 17
Applied a total of 64 rules in 13 ms. Remains 13 /45 variables (removed 32) and now considering 17/62 (removed 45) transitions.
[2024-05-22 10:28:14] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2024-05-22 10:28:14] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:28:14] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2024-05-22 10:28:14] [INFO ] Invariant cache hit.
[2024-05-22 10:28:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/56 places, 17/72 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 13/56 places, 17/72 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-01
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-01 finished in 264 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||(p1&&X(p1))))))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 50 transition count 66
Applied a total of 12 rules in 5 ms. Remains 50 /56 variables (removed 6) and now considering 66/72 (removed 6) transitions.
// Phase 1: matrix 66 rows 50 cols
[2024-05-22 10:28:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 10:28:14] [INFO ] Invariant cache hit.
[2024-05-22 10:28:14] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:28:14] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 10:28:14] [INFO ] Invariant cache hit.
[2024-05-22 10:28:14] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 96 constraints, problems are : Problem set: 0 solved, 65 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 66/116 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 44/96 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 65/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 161 constraints, problems are : Problem set: 0 solved, 65 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 50/50 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
After SMT, in 1557ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 1558ms
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 66/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 50/56 places, 66/72 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-02
Stuttering criterion allowed to conclude after 320 steps with 8 reset in 7 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-02 finished in 1820 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(p0)))'
Support contains 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 49 transition count 65
Applied a total of 14 rules in 8 ms. Remains 49 /56 variables (removed 7) and now considering 65/72 (removed 7) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-05-22 10:28:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 10:28:16] [INFO ] Invariant cache hit.
[2024-05-22 10:28:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [48]
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 : 48/56 places, 65/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 48/56 places, 65/72 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-05 finished in 219 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 3 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 50 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 48 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 48 transition count 64
Applied a total of 16 rules in 6 ms. Remains 48 /56 variables (removed 8) and now considering 64/72 (removed 8) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-05-22 10:28:16] [INFO ] Computed 2 invariants in 3 ms
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 10:28:16] [INFO ] Invariant cache hit.
[2024-05-22 10:28:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants and state equation in 61 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/56 places, 64/72 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 100 ms. Remains : 47/56 places, 64/72 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-06 finished in 237 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||(X(G(p1))&&G(p2)&&F(p3)))))'
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 53 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 53 transition count 69
Applied a total of 6 rules in 7 ms. Remains 53 /56 variables (removed 3) and now considering 69/72 (removed 3) transitions.
// Phase 1: matrix 69 rows 53 cols
[2024-05-22 10:28:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:28:16] [INFO ] Invariant cache hit.
[2024-05-22 10:28:16] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 10:28:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 69/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 52/56 places, 69/72 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (NOT p2) (NOT p1) (NOT p3)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-08 finished in 331 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((p0||X(p1))) U p1)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 54 transition count 70
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 52 transition count 68
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 52 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 51 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 51 transition count 67
Applied a total of 10 rules in 7 ms. Remains 51 /56 variables (removed 5) and now considering 67/72 (removed 5) transitions.
// Phase 1: matrix 67 rows 51 cols
[2024-05-22 10:28:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:28:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:28:17] [INFO ] Invariant cache hit.
[2024-05-22 10:28:17] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-22 10:28:17] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 67/72 transitions.
Applied a total of 0 rules in 3 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 104 ms. Remains : 50/56 places, 67/72 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Graph (complete) has 130 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 32 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-10 finished in 701 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(p0))'
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 72/72 transitions.
Graph (complete) has 161 edges and 56 vertex of which 53 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
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 58 edges and 50 vertex of which 42 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Graph (trivial) has 45 edges and 42 vertex of which 22 / 42 are part of one of the 11 SCC in 3 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 31 transition count 54
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 28 place count 25 transition count 43
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 20 transition count 33
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 20 transition count 33
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 16 transition count 25
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 16 transition count 25
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 12 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 12 transition count 17
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 8 transition count 13
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 8 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 7 transition count 12
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 65 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 5 transition count 9
Applied a total of 67 rules in 19 ms. Remains 5 /56 variables (removed 51) and now considering 9/72 (removed 63) transitions.
[2024-05-22 10:28:17] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-22 10:28:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 10:28:17] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 10:28:17] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-22 10:28:17] [INFO ] Invariant cache hit.
[2024-05-22 10:28:17] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-22 10:28:17] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-22 10:28:17] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
[2024-05-22 10:28:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 33 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/56 places, 9/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 5/56 places, 9/72 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-LTLCardinality-13 finished in 177 ms.
All properties solved by simple procedures.
Total runtime 7735 ms.

BK_STOP 1716373698049

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-06a, 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 r136-tall-171631132500363"
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 [ "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 ;